/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:38:38,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:38:38,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:38:38,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:38:38,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:38:38,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:38:38,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:38:38,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:38:38,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:38:38,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:38:38,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:38:38,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:38:38,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:38:38,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:38:38,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:38:38,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:38:38,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:38:38,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:38:38,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:38:38,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:38:38,413 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:38:38,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:38:38,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:38:38,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:38:38,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:38:38,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:38:38,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:38:38,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:38:38,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:38:38,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:38:38,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:38:38,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:38:38,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:38:38,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:38:38,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:38:38,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:38:38,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:38:38,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:38:38,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:38:38,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:38:38,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:38:38,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:38:38,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:38:38,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:38:38,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:38:38,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:38:38,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:38:38,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:38:38,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:38:38,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:38:38,450 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:38:38,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:38:38,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:38:38,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:38:38,452 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:38:38,452 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:38:38,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:38:38,452 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:38:38,452 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-08 03:38:38,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:38:38,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:38:38,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:38:38,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:38:38,743 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:38:38,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-1.i [2022-04-08 03:38:38,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb8a74fb/0bf2897d358846afaafd8e0367ee32a7/FLAGff79a14e6 [2022-04-08 03:38:39,158 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:38:39,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-1.i [2022-04-08 03:38:39,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb8a74fb/0bf2897d358846afaafd8e0367ee32a7/FLAGff79a14e6 [2022-04-08 03:38:39,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb8a74fb/0bf2897d358846afaafd8e0367ee32a7 [2022-04-08 03:38:39,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:38:39,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:38:39,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:38:39,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:38:39,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:38:39,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a54a947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39, skipping insertion in model container [2022-04-08 03:38:39,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:38:39,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:38:39,378 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.i[849,862] [2022-04-08 03:38:39,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:38:39,395 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:38:39,417 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.i[849,862] [2022-04-08 03:38:39,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:38:39,433 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:38:39,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39 WrapperNode [2022-04-08 03:38:39,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:38:39,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:38:39,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:38:39,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:38:39,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:38:39,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:38:39,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:38:39,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:38:39,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (1/1) ... [2022-04-08 03:38:39,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:38:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:39,498 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-08 03:38:39,503 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-08 03:38:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:38:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:38:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:38:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:38:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:38:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:38:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:38:39,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:38:39,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:38:39,762 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:38:39,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:38:39,781 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:38:39,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:38:39 BoogieIcfgContainer [2022-04-08 03:38:39,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:38:39,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:38:39,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:38:39,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:38:39,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:38:39" (1/3) ... [2022-04-08 03:38:39,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e7014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:38:39, skipping insertion in model container [2022-04-08 03:38:39,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:38:39" (2/3) ... [2022-04-08 03:38:39,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e7014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:38:39, skipping insertion in model container [2022-04-08 03:38:39,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:38:39" (3/3) ... [2022-04-08 03:38:39,791 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-1.i [2022-04-08 03:38:39,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:38:39,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:38:39,826 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:38:39,831 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-08 03:38:39,831 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:38:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-08 03:38:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:38:39,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:39,851 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:39,851 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 1 times [2022-04-08 03:38:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:39,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919434531] [2022-04-08 03:38:39,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:38:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 2 times [2022-04-08 03:38:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:39,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323500222] [2022-04-08 03:38:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27#true} is VALID [2022-04-08 03:38:40,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 03:38:40,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-08 03:38:40,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:40,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27#true} is VALID [2022-04-08 03:38:40,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 03:38:40,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-08 03:38:40,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-08 03:38:40,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27#true} is VALID [2022-04-08 03:38:40,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-08 03:38:40,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0; {28#false} is VALID [2022-04-08 03:38:40,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-08 03:38:40,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {28#false} is VALID [2022-04-08 03:38:40,027 INFO L272 TraceCheckUtils]: 10: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {28#false} is VALID [2022-04-08 03:38:40,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 03:38:40,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 03:38:40,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 03:38:40,028 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-08 03:38:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:40,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323500222] [2022-04-08 03:38:40,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323500222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:40,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:40,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:38:40,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919434531] [2022-04-08 03:38:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919434531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:40,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:40,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:38:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160256466] [2022-04-08 03:38:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:40,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,063 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-08 03:38:40,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:38:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:38:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:38:40,082 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,192 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 03:38:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:38:40,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-08 03:38:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-08 03:38:40,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-08 03:38:40,260 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-08 03:38:40,265 INFO L225 Difference]: With dead ends: 40 [2022-04-08 03:38:40,265 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:38:40,267 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-08 03:38:40,269 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 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-08 03:38:40,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:38:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 03:38:40,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:40,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,296 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,296 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,303 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 03:38:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 03:38:40,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:40,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:40,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 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 17 states. [2022-04-08 03:38:40,305 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 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 17 states. [2022-04-08 03:38:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,311 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 03:38:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 03:38:40,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:40,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:40,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:40,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-08 03:38:40,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-08 03:38:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:40,318 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-08 03:38:40,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08 03:38:40,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-08 03:38:40,338 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-08 03:38:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 03:38:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:38:40,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:40,339 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:40,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:38:40,340 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 1 times [2022-04-08 03:38:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:40,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330817188] [2022-04-08 03:38:40,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:38:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 2 times [2022-04-08 03:38:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:40,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903278807] [2022-04-08 03:38:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {183#true} is VALID [2022-04-08 03:38:40,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-08 03:38:40,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-08 03:38:40,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:40,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {183#true} is VALID [2022-04-08 03:38:40,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-08 03:38:40,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-08 03:38:40,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret8 := main(); {183#true} is VALID [2022-04-08 03:38:40,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {188#(= main_~i~0 0)} is VALID [2022-04-08 03:38:40,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~i~0 0)} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-08 03:38:40,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#false} ~i~0 := 0; {184#false} is VALID [2022-04-08 03:38:40,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-08 03:38:40,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {184#false} is VALID [2022-04-08 03:38:40,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {184#false} is VALID [2022-04-08 03:38:40,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-04-08 03:38:40,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2022-04-08 03:38:40,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-08 03:38:40,442 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-08 03:38:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903278807] [2022-04-08 03:38:40,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903278807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:40,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:40,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:38:40,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:40,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330817188] [2022-04-08 03:38:40,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330817188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:40,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:40,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:38:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977471749] [2022-04-08 03:38:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:40,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:40,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,465 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-08 03:38:40,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:38:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:40,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:38:40,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:38:40,469 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,579 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 03:38:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:38:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 03:38:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 03:38:40,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 03:38:40,617 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-08 03:38:40,621 INFO L225 Difference]: With dead ends: 30 [2022-04-08 03:38:40,621 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 03:38:40,622 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-08 03:38:40,626 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:40,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 03:38:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-08 03:38:40,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:40,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,645 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,645 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,648 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 03:38:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 03:38:40,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:40,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:40,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 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 21 states. [2022-04-08 03:38:40,649 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 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 21 states. [2022-04-08 03:38:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:40,651 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 03:38:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 03:38:40,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:40,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:40,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:40,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 03:38:40,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-08 03:38:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:40,653 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 03:38:40,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-08 03:38:40,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 03:38:40,675 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-08 03:38:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 03:38:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:38:40,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:40,676 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:40,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:38:40,677 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 1 times [2022-04-08 03:38:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:40,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707799593] [2022-04-08 03:38:40,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:40,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:40,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 2 times [2022-04-08 03:38:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:40,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769884898] [2022-04-08 03:38:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {334#true} is VALID [2022-04-08 03:38:40,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-08 03:38:40,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-08 03:38:40,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:40,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {334#true} is VALID [2022-04-08 03:38:40,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-08 03:38:40,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-08 03:38:40,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-08 03:38:40,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {339#(= main_~i~0 0)} is VALID [2022-04-08 03:38:40,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {339#(= main_~i~0 0)} is VALID [2022-04-08 03:38:40,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:40,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:40,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-08 03:38:40,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-08 03:38:40,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-08 03:38:40,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:40,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-08 03:38:40,830 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-08 03:38:40,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-08 03:38:40,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-08 03:38:40,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-08 03:38:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:38:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:40,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769884898] [2022-04-08 03:38:40,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769884898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:40,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733283530] [2022-04-08 03:38:40,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:40,852 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-08 03:38:40,867 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-08 03:38:40,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:40,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:40,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 03:38:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:40,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:41,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-08 03:38:41,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {334#true} is VALID [2022-04-08 03:38:41,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-08 03:38:41,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-08 03:38:41,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-08 03:38:41,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {360#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:41,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {360#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:41,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:41,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-08 03:38:41,036 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-08 03:38:41,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-08 03:38:41,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-08 03:38:41,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-08 03:38:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:38:41,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:41,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-08 03:38:41,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-08 03:38:41,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-08 03:38:41,120 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-08 03:38:41,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-08 03:38:41,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:41,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-08 03:38:41,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-08 03:38:41,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-08 03:38:41,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(< main_~i~0 2048)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-08 03:38:41,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {424#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:41,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {428#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:41,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {428#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:41,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-08 03:38:41,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-08 03:38:41,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-08 03:38:41,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {334#true} is VALID [2022-04-08 03:38:41,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-08 03:38:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:38:41,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733283530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:41,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 03:38:41,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707799593] [2022-04-08 03:38:41,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707799593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:41,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:41,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:38:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484395368] [2022-04-08 03:38:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:41,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:41,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,139 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-08 03:38:41,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:38:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:38:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:38:41,140 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:41,227 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-08 03:38:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:38:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 03:38:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 03:38:41,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-08 03:38:41,266 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-08 03:38:41,268 INFO L225 Difference]: With dead ends: 35 [2022-04-08 03:38:41,268 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 03:38:41,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 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-08 03:38:41,270 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:41,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 03:38:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-08 03:38:41,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:41,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:41,285 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:41,286 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:41,296 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 03:38:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 03:38:41,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:41,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:41,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 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 25 states. [2022-04-08 03:38:41,297 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 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 25 states. [2022-04-08 03:38:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:41,300 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 03:38:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 03:38:41,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:41,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:41,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:41,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-08 03:38:41,309 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2022-04-08 03:38:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:41,309 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-08 03:38:41,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-08 03:38:41,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-08 03:38:41,333 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-08 03:38:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 03:38:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:38:41,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:41,335 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:41,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 03:38:41,551 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-08 03:38:41,552 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 3 times [2022-04-08 03:38:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:41,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402185921] [2022-04-08 03:38:41,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:41,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:41,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 4 times [2022-04-08 03:38:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:41,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925265475] [2022-04-08 03:38:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:41,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {622#true} is VALID [2022-04-08 03:38:41,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-08 03:38:41,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-08 03:38:41,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:41,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {622#true} is VALID [2022-04-08 03:38:41,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-08 03:38:41,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-08 03:38:41,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-08 03:38:41,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {627#(= main_~i~0 0)} is VALID [2022-04-08 03:38:41,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {627#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {627#(= main_~i~0 0)} is VALID [2022-04-08 03:38:41,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {628#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:41,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {628#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:41,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:41,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:41,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-08 03:38:41,694 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-08 03:38:41,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-08 03:38:41,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-08 03:38:41,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-08 03:38:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:38:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:41,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925265475] [2022-04-08 03:38:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925265475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36361455] [2022-04-08 03:38:41,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:38:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:41,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:41,696 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-08 03:38:41,723 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-08 03:38:41,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:38:41,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:41,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:38:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:41,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:41,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-08 03:38:41,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {622#true} is VALID [2022-04-08 03:38:41,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-08 03:38:41,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-08 03:38:41,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-08 03:38:41,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {649#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:41,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {649#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:41,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {628#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:41,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {628#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:41,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:41,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:41,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-08 03:38:41,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-08 03:38:41,883 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-08 03:38:41,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-08 03:38:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:38:41,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:41,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-08 03:38:41,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-08 03:38:41,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-08 03:38:41,998 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-08 03:38:41,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-08 03:38:41,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-08 03:38:41,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(< main_~i~0 2048)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-08 03:38:42,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {731#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:42,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {735#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:42,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:42,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {742#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {742#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:42,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {742#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:42,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-08 03:38:42,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-08 03:38:42,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-08 03:38:42,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {622#true} is VALID [2022-04-08 03:38:42,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-08 03:38:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:38:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36361455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:42,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 03:38:42,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402185921] [2022-04-08 03:38:42,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402185921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:42,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:42,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:38:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967712573] [2022-04-08 03:38:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 22 [2022-04-08 03:38:42,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:42,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 03:38:42,020 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-08 03:38:42,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:38:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:38:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:38:42,021 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 03:38:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:42,186 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-08 03:38:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:38:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 22 [2022-04-08 03:38:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 03:38:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 03:38:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 03:38:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 03:38:42,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-08 03:38:42,234 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-08 03:38:42,235 INFO L225 Difference]: With dead ends: 41 [2022-04-08 03:38:42,235 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 03:38:42,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:38:42,236 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:42,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 03:38:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-08 03:38:42,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:42,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:42,250 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:42,250 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:42,251 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 03:38:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 03:38:42,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:42,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:42,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 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 29 states. [2022-04-08 03:38:42,252 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 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 29 states. [2022-04-08 03:38:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:42,253 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 03:38:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 03:38:42,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:42,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:42,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:42,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-08 03:38:42,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2022-04-08 03:38:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:42,255 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-08 03:38:42,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 03:38:42,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-08 03:38:42,281 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-08 03:38:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-08 03:38:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 03:38:42,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:42,282 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:42,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 03:38:42,494 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-08 03:38:42,494 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 5 times [2022-04-08 03:38:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:42,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723900660] [2022-04-08 03:38:42,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:42,503 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:42,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 6 times [2022-04-08 03:38:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:42,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369166422] [2022-04-08 03:38:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:42,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {966#true} is VALID [2022-04-08 03:38:42,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 03:38:42,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-08 03:38:42,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:42,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {966#true} is VALID [2022-04-08 03:38:42,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 03:38:42,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-08 03:38:42,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-08 03:38:42,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {971#(= main_~i~0 0)} is VALID [2022-04-08 03:38:42,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {971#(= main_~i~0 0)} is VALID [2022-04-08 03:38:42,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:42,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {972#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:42,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:42,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {973#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:42,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {973#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:42,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-08 03:38:42,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-08 03:38:42,615 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 03:38:42,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 03:38:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369166422] [2022-04-08 03:38:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369166422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682172943] [2022-04-08 03:38:42,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:38:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:42,617 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-08 03:38:42,618 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-08 03:38:42,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 03:38:42,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:42,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:38:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:42,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:42,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-08 03:38:42,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {966#true} is VALID [2022-04-08 03:38:42,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 03:38:42,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-08 03:38:42,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-08 03:38:42,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {994#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:42,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {994#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {994#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:42,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {994#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:42,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {972#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:42,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:42,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {973#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:42,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {973#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-08 03:38:42,766 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 03:38:42,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 03:38:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:42,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:42,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 03:38:42,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 03:38:42,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 03:38:42,868 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-08 03:38:42,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-08 03:38:42,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(< main_~i~0 2048)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-08 03:38:42,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:42,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1098#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:42,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1098#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:42,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1105#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:42,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1105#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:42,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1112#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:42,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1112#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:42,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-08 03:38:42,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-08 03:38:42,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 03:38:42,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {966#true} is VALID [2022-04-08 03:38:42,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-08 03:38:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:42,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682172943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:42,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 03:38:42,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:42,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723900660] [2022-04-08 03:38:42,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723900660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:38:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322879637] [2022-04-08 03:38:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:42,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 26 [2022-04-08 03:38:42,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:42,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 03:38:42,891 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-08 03:38:42,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:38:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:38:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:38:42,893 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 03:38:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:43,043 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-08 03:38:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:38:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 26 [2022-04-08 03:38:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 03:38:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-08 03:38:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 03:38:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-08 03:38:43,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-08 03:38:43,085 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-08 03:38:43,086 INFO L225 Difference]: With dead ends: 47 [2022-04-08 03:38:43,086 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 03:38:43,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 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-08 03:38:43,087 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:43,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 03:38:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-08 03:38:43,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:43,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:43,102 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:43,102 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:43,104 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-08 03:38:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-08 03:38:43,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:43,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:43,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 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 33 states. [2022-04-08 03:38:43,104 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 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 33 states. [2022-04-08 03:38:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:43,106 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-08 03:38:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-08 03:38:43,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:43,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:43,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:43,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-08 03:38:43,107 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-08 03:38:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:43,107 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-08 03:38:43,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-08 03:38:43,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-08 03:38:43,136 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-08 03:38:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-08 03:38:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 03:38:43,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:43,137 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:43,155 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-08 03:38:43,351 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-08 03:38:43,352 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 7 times [2022-04-08 03:38:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:43,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726181663] [2022-04-08 03:38:43,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:43,357 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:43,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 8 times [2022-04-08 03:38:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:43,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769022443] [2022-04-08 03:38:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:43,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1366#true} is VALID [2022-04-08 03:38:43,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-08 03:38:43,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-08 03:38:43,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:43,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1366#true} is VALID [2022-04-08 03:38:43,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-08 03:38:43,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-08 03:38:43,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-08 03:38:43,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1371#(= main_~i~0 0)} is VALID [2022-04-08 03:38:43,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {1371#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1371#(= main_~i~0 0)} is VALID [2022-04-08 03:38:43,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1371#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1372#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:43,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1372#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:43,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1373#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:43,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1373#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:43,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1374#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:43,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1374#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:43,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1375#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:43,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-08 03:38:43,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-08 03:38:43,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-08 03:38:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 03:38:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:43,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769022443] [2022-04-08 03:38:43,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769022443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:43,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738574918] [2022-04-08 03:38:43,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:43,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:43,484 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-08 03:38:43,485 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-08 03:38:43,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:43,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:43,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:38:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:43,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:43,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-08 03:38:43,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1366#true} is VALID [2022-04-08 03:38:43,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-08 03:38:43,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-08 03:38:43,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-08 03:38:43,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1395#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:43,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {1395#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1395#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:43,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1395#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1372#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:43,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1372#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:43,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1373#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:43,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1373#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:43,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1374#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:43,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1374#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:43,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1375#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-08 03:38:43,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-08 03:38:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 03:38:43,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:43,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-08 03:38:43,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-08 03:38:43,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-08 03:38:43,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-08 03:38:43,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {1517#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1513#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:43,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {1517#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1517#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:43,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {1524#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1517#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:43,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {1524#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1524#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:43,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1524#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:43,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1531#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:43,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1538#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:43,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {1538#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1538#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:43,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1538#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:43,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-08 03:38:43,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-08 03:38:43,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-08 03:38:43,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1366#true} is VALID [2022-04-08 03:38:43,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-08 03:38:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 03:38:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738574918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:43,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:43,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 03:38:43,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726181663] [2022-04-08 03:38:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726181663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:43,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:43,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:38:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961479282] [2022-04-08 03:38:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:43,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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 30 [2022-04-08 03:38:43,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:43,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-08 03:38:43,831 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-08 03:38:43,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:38:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:38:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:38:43,832 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-08 03:38:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:44,002 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-08 03:38:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:38:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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 30 [2022-04-08 03:38:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-08 03:38:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 03:38:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-08 03:38:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 03:38:44,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 03:38:44,048 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-08 03:38:44,049 INFO L225 Difference]: With dead ends: 53 [2022-04-08 03:38:44,049 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 03:38:44,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 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-08 03:38:44,050 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:44,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 03:38:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-04-08 03:38:44,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:44,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:44,089 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:44,089 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:44,090 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 03:38:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 03:38:44,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:44,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:44,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 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 37 states. [2022-04-08 03:38:44,091 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 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 37 states. [2022-04-08 03:38:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:44,092 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 03:38:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 03:38:44,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:44,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:44,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:44,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-08 03:38:44,094 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-04-08 03:38:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:44,094 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-08 03:38:44,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-08 03:38:44,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-08 03:38:44,124 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-08 03:38:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-08 03:38:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 03:38:44,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:44,125 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:44,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 03:38:44,337 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-08 03:38:44,337 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:44,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 9 times [2022-04-08 03:38:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:44,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972542363] [2022-04-08 03:38:44,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:44,342 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:44,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 10 times [2022-04-08 03:38:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:44,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244934721] [2022-04-08 03:38:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:44,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {1833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1822#true} is VALID [2022-04-08 03:38:44,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-08 03:38:44,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-08 03:38:44,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:44,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1822#true} is VALID [2022-04-08 03:38:44,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-08 03:38:44,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-08 03:38:44,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-08 03:38:44,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1827#(= main_~i~0 0)} is VALID [2022-04-08 03:38:44,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1827#(= main_~i~0 0)} is VALID [2022-04-08 03:38:44,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1827#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1828#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:44,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1828#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:44,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1829#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:44,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1829#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:44,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:44,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1830#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:44,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1831#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:44,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1831#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:44,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1832#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:44,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-08 03:38:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 03:38:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244934721] [2022-04-08 03:38:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244934721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291712936] [2022-04-08 03:38:44,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:38:44,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:44,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:44,438 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-08 03:38:44,439 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-08 03:38:44,518 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:38:44,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:44,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:38:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:44,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:44,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-08 03:38:44,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1822#true} is VALID [2022-04-08 03:38:44,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-08 03:38:44,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-08 03:38:44,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-08 03:38:44,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1852#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:44,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1852#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1852#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:44,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1852#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1828#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:44,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1828#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:44,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1829#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:44,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1829#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:44,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:44,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1830#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:44,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1831#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:44,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1831#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:44,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {1831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1832#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:44,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-08 03:38:44,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-08 03:38:44,695 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-08 03:38:44,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-08 03:38:44,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-08 03:38:44,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-08 03:38:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 03:38:44,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-08 03:38:44,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-08 03:38:44,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-08 03:38:44,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {1992#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1988#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:44,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1992#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1992#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:44,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1999#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1992#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:44,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1999#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1999#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:44,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {2006#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1999#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:44,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {2006#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2006#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:44,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2013#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2006#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:44,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2013#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2013#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:44,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2013#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:44,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2020#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:44,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2020#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:44,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-08 03:38:44,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-08 03:38:44,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-08 03:38:44,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1822#true} is VALID [2022-04-08 03:38:44,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-08 03:38:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 03:38:44,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291712936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:44,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:44,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 03:38:44,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:44,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972542363] [2022-04-08 03:38:44,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972542363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:44,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:44,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:38:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418886344] [2022-04-08 03:38:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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 34 [2022-04-08 03:38:44,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:44,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-08 03:38:44,922 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-08 03:38:44,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:38:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:44,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:38:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:38:44,924 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-08 03:38:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:45,117 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-08 03:38:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:38:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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 34 [2022-04-08 03:38:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-08 03:38:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-08 03:38:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-08 03:38:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-08 03:38:45,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-08 03:38:45,155 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-08 03:38:45,156 INFO L225 Difference]: With dead ends: 59 [2022-04-08 03:38:45,156 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 03:38:45,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 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-08 03:38:45,157 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:45,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:38:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 03:38:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-04-08 03:38:45,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:45,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:45,176 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:45,176 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:45,177 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-08 03:38:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-08 03:38:45,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:45,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:45,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 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 41 states. [2022-04-08 03:38:45,178 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 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 41 states. [2022-04-08 03:38:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:45,179 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-08 03:38:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-08 03:38:45,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:45,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:45,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:45,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-08 03:38:45,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-08 03:38:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:45,180 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-08 03:38:45,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-08 03:38:45,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-08 03:38:45,208 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-08 03:38:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-08 03:38:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 03:38:45,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:45,208 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:45,229 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-08 03:38:45,429 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-08 03:38:45,429 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 11 times [2022-04-08 03:38:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:45,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93219565] [2022-04-08 03:38:45,435 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:45,435 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:45,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 12 times [2022-04-08 03:38:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:45,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184880583] [2022-04-08 03:38:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:45,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:45,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-08 03:38:45,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-08 03:38:45,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2339#(= main_~i~0 0)} is VALID [2022-04-08 03:38:45,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {2339#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2339#(= main_~i~0 0)} is VALID [2022-04-08 03:38:45,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {2339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:45,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {2340#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:45,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {2340#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2341#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:45,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2341#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:45,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2342#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:45,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2342#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:45,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2343#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:45,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2343#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:45,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2344#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:45,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {2344#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2344#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:45,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {2344#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2345#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {2335#false} ~i~0 := 0; {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {2335#false} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-08 03:38:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:38:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:45,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184880583] [2022-04-08 03:38:45,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184880583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:45,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672603548] [2022-04-08 03:38:45,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:38:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:45,535 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-08 03:38:45,536 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-08 03:38:45,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 03:38:45,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:45,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:38:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:45,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:45,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:45,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:45,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-08 03:38:45,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2407#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:45,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {2407#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2407#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:45,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2407#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:45,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {2340#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2340#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:45,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2341#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:45,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {2341#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2341#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:45,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2342#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:45,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2342#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:45,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2343#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:45,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {2343#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2343#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:45,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {2343#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:45,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2344#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2344#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:45,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {2344#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2345#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:45,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-08 03:38:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:38:45,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:46,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {2477#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-08 03:38:46,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {2481#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2477#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:46,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {2481#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2481#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:46,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {2488#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2481#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:46,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {2488#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2488#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:46,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {2495#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2488#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:46,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {2495#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2495#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:46,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {2502#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2495#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:46,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {2502#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2502#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:46,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {2509#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2502#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:46,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {2509#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2509#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:46,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2509#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:46,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2516#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2516#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-08 03:38:46,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-08 03:38:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 03:38:46,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672603548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:46,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:46,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 03:38:46,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93219565] [2022-04-08 03:38:46,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93219565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:46,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:46,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:38:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797293044] [2022-04-08 03:38:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 38 [2022-04-08 03:38:46,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:46,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-08 03:38:46,087 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-08 03:38:46,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:38:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:38:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:38:46,088 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-08 03:38:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:46,306 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-08 03:38:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:38:46,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 38 [2022-04-08 03:38:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-08 03:38:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-08 03:38:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-08 03:38:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-08 03:38:46,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-04-08 03:38:46,368 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-08 03:38:46,369 INFO L225 Difference]: With dead ends: 65 [2022-04-08 03:38:46,369 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 03:38:46,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-08 03:38:46,370 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:46,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 26 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 03:38:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-08 03:38:46,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:46,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:46,393 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:46,393 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:46,394 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 03:38:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 03:38:46,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:46,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:46,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 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 45 states. [2022-04-08 03:38:46,395 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 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 45 states. [2022-04-08 03:38:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:46,396 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 03:38:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 03:38:46,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:46,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:46,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:46,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-08 03:38:46,397 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2022-04-08 03:38:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:46,397 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-08 03:38:46,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-08 03:38:46,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-08 03:38:46,426 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-08 03:38:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-08 03:38:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 03:38:46,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:46,427 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:46,446 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-08 03:38:46,644 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-08 03:38:46,645 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 13 times [2022-04-08 03:38:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:46,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [395757078] [2022-04-08 03:38:46,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:46,650 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:46,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 14 times [2022-04-08 03:38:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452794200] [2022-04-08 03:38:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:46,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {2915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2902#true} is VALID [2022-04-08 03:38:46,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 03:38:46,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-08 03:38:46,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:46,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2902#true} is VALID [2022-04-08 03:38:46,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 03:38:46,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-08 03:38:46,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-08 03:38:46,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2907#(= main_~i~0 0)} is VALID [2022-04-08 03:38:46,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {2907#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2907#(= main_~i~0 0)} is VALID [2022-04-08 03:38:46,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {2907#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2908#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:46,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2908#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:46,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {2908#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2909#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:46,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2909#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:46,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2910#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:46,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2910#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:46,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2911#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:46,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2911#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:46,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {2911#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2912#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:46,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2912#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:46,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2913#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2913#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {2913#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2914#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-08 03:38:46,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-08 03:38:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 03:38:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452794200] [2022-04-08 03:38:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452794200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436085414] [2022-04-08 03:38:46,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:46,767 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-08 03:38:46,768 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-08 03:38:46,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:46,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:46,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:38:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:46,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:47,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-08 03:38:47,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2902#true} is VALID [2022-04-08 03:38:47,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 03:38:47,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-08 03:38:47,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-08 03:38:47,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2934#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:47,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {2934#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2934#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:47,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {2934#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2908#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:47,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2908#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:47,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {2908#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2909#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:47,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2909#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:47,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2910#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:47,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2910#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:47,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2911#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:47,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2911#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:47,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {2911#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2912#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:47,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2912#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:47,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2913#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:47,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2913#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:47,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {2913#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2914#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-08 03:38:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 03:38:47,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:47,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-08 03:38:47,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {3106#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-08 03:38:47,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {3110#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:47,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {3110#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3110#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:47,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {3117#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3110#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:47,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {3117#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3117#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:47,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {3124#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3117#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:47,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {3124#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3124#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:47,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {3131#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3124#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:47,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {3131#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3131#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:47,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3131#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:47,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {3138#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3138#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:47,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {3145#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3138#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:47,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {3145#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3145#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:47,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {3152#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3145#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:47,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {3152#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3152#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:47,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3152#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:47,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-08 03:38:47,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-08 03:38:47,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 03:38:47,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2902#true} is VALID [2022-04-08 03:38:47,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-08 03:38:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 03:38:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436085414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:47,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:47,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 03:38:47,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [395757078] [2022-04-08 03:38:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [395757078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:47,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:47,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:38:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50872290] [2022-04-08 03:38:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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 42 [2022-04-08 03:38:47,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:47,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-08 03:38:47,320 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-08 03:38:47,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:38:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:38:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:38:47,321 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-08 03:38:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:47,564 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-08 03:38:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:38:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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 42 [2022-04-08 03:38:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-08 03:38:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-08 03:38:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-08 03:38:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-08 03:38:47,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2022-04-08 03:38:47,629 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-08 03:38:47,630 INFO L225 Difference]: With dead ends: 71 [2022-04-08 03:38:47,630 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 03:38:47,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 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-08 03:38:47,632 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:47,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 03:38:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-08 03:38:47,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:47,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:47,682 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:47,683 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:47,684 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-08 03:38:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-08 03:38:47,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:47,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:47,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 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 49 states. [2022-04-08 03:38:47,685 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 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 49 states. [2022-04-08 03:38:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:47,686 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-08 03:38:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-08 03:38:47,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:47,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:47,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:47,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-08 03:38:47,687 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-04-08 03:38:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:47,688 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-08 03:38:47,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-08 03:38:47,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-08 03:38:47,733 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-08 03:38:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-08 03:38:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 03:38:47,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:47,733 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:47,772 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-08 03:38:47,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:47,947 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 15 times [2022-04-08 03:38:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:47,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125830331] [2022-04-08 03:38:47,953 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:47,953 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:47,953 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 16 times [2022-04-08 03:38:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:47,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305395671] [2022-04-08 03:38:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:48,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {3540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3526#true} is VALID [2022-04-08 03:38:48,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-08 03:38:48,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-08 03:38:48,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:48,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {3540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3526#true} is VALID [2022-04-08 03:38:48,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-08 03:38:48,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-08 03:38:48,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-08 03:38:48,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3531#(= main_~i~0 0)} is VALID [2022-04-08 03:38:48,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {3531#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3531#(= main_~i~0 0)} is VALID [2022-04-08 03:38:48,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {3531#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3532#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:48,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {3532#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3532#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:48,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {3532#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3533#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:48,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {3533#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3533#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:48,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {3533#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3534#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:48,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {3534#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3534#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:48,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {3534#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3535#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:48,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3535#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:48,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3536#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:48,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3536#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:48,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3537#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:48,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {3537#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3537#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:48,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {3537#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3538#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:48,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {3538#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3538#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {3538#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3539#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-08 03:38:48,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-08 03:38:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 03:38:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:48,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305395671] [2022-04-08 03:38:48,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305395671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:48,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572123794] [2022-04-08 03:38:48,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:38:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:48,057 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-08 03:38:48,083 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-08 03:38:48,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:38:48,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:48,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 03:38:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:48,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:48,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-08 03:38:48,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3526#true} is VALID [2022-04-08 03:38:48,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-08 03:38:48,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-08 03:38:48,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-08 03:38:48,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3559#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:48,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {3559#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3559#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:48,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3532#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:48,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {3532#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3532#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:48,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {3532#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3533#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:48,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {3533#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3533#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:48,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {3533#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3534#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:48,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {3534#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3534#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:48,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {3534#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3535#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:48,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3535#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:48,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3536#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:48,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3536#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:48,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3537#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:48,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {3537#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3537#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:48,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {3537#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3538#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:48,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {3538#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3538#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:48,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {3538#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3539#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:48,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-08 03:38:48,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-08 03:38:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 03:38:48,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:48,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-08 03:38:48,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-08 03:38:48,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-08 03:38:48,676 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-08 03:38:48,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-08 03:38:48,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-08 03:38:48,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-08 03:38:48,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-08 03:38:48,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3749#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:48,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3753#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:48,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3753#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:48,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3760#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:48,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {3767#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3760#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:48,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {3767#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3767#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:48,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {3774#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3767#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:48,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {3774#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3774#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:48,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {3781#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3774#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:48,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {3781#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3781#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:48,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {3788#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3781#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:48,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {3788#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3788#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:48,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {3795#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3788#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:48,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {3795#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3795#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:48,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3802#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3795#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:48,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {3802#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3802#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:48,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3802#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:48,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-08 03:38:48,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-08 03:38:48,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-08 03:38:48,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3526#true} is VALID [2022-04-08 03:38:48,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-08 03:38:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 03:38:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572123794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:48,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:48,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 03:38:48,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125830331] [2022-04-08 03:38:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125830331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:48,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:48,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 03:38:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986989068] [2022-04-08 03:38:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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 46 [2022-04-08 03:38:48,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:48,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-08 03:38:48,708 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-08 03:38:48,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 03:38:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 03:38:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:38:48,709 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-08 03:38:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:49,042 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-08 03:38:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:38:49,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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 46 [2022-04-08 03:38:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-08 03:38:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-08 03:38:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-08 03:38:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-08 03:38:49,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-08 03:38:49,099 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-08 03:38:49,100 INFO L225 Difference]: With dead ends: 77 [2022-04-08 03:38:49,100 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 03:38:49,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 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-08 03:38:49,101 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:49,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 03:38:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-08 03:38:49,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:49,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:49,141 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:49,141 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:49,142 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 03:38:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 03:38:49,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:49,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:49,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 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 53 states. [2022-04-08 03:38:49,142 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 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 53 states. [2022-04-08 03:38:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:49,143 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 03:38:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 03:38:49,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:49,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:49,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:49,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-08 03:38:49,144 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-04-08 03:38:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:49,144 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-08 03:38:49,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-08 03:38:49,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-08 03:38:49,186 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-08 03:38:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-08 03:38:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 03:38:49,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:49,187 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:49,213 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-08 03:38:49,395 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-08 03:38:49,396 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 17 times [2022-04-08 03:38:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:49,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690173218] [2022-04-08 03:38:49,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:49,402 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:49,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 18 times [2022-04-08 03:38:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:49,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907843869] [2022-04-08 03:38:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:49,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {4221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4206#true} is VALID [2022-04-08 03:38:49,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-08 03:38:49,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-08 03:38:49,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:49,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {4221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4206#true} is VALID [2022-04-08 03:38:49,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-08 03:38:49,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-08 03:38:49,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-08 03:38:49,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4211#(= main_~i~0 0)} is VALID [2022-04-08 03:38:49,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {4211#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4211#(= main_~i~0 0)} is VALID [2022-04-08 03:38:49,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {4211#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4212#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:49,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {4212#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4212#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:49,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {4212#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4213#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:49,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {4213#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4213#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:49,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {4213#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4214#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:49,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4214#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:49,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4215#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:49,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4215#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:49,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {4215#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4216#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:49,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {4216#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4216#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:49,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {4216#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4217#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:49,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {4217#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4217#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:49,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {4217#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4218#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:49,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {4218#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4218#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:49,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {4218#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4219#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:49,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {4219#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4219#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {4219#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4220#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-08 03:38:49,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-08 03:38:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 03:38:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:49,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907843869] [2022-04-08 03:38:49,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907843869] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:49,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570976736] [2022-04-08 03:38:49,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:38:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:49,550 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-08 03:38:49,551 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-08 03:38:50,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 03:38:50,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:50,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 03:38:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:50,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:50,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-08 03:38:50,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4206#true} is VALID [2022-04-08 03:38:50,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-08 03:38:50,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-08 03:38:50,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-08 03:38:50,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4240#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:50,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {4240#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4240#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:50,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4212#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:50,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {4212#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4212#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:50,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {4212#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4213#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:50,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {4213#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4213#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:50,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {4213#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4214#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:50,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4214#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:50,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4215#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:50,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4215#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:50,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {4215#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4216#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:50,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {4216#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4216#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:50,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {4216#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4217#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:50,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {4217#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4217#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:50,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {4217#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4218#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:50,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {4218#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4218#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:50,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {4218#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4219#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:50,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {4219#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4219#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:50,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {4219#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4220#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-08 03:38:50,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-08 03:38:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 03:38:50,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:50,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-08 03:38:50,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-08 03:38:50,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {4448#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-08 03:38:50,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {4452#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4448#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:50,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4452#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:50,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {4459#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4452#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:50,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {4459#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4459#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:50,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {4466#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4459#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:50,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {4466#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4466#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:50,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {4473#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4466#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:50,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {4473#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4473#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:50,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {4480#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4473#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:50,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {4480#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4480#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:50,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {4487#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4480#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:50,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {4487#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4487#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:50,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {4494#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4487#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:50,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {4494#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4494#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:50,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {4501#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4494#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:50,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {4501#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4501#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:50,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {4508#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4501#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:50,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {4508#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4508#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:50,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4508#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:50,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-08 03:38:50,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-08 03:38:50,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-08 03:38:50,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4206#true} is VALID [2022-04-08 03:38:50,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-08 03:38:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 03:38:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570976736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:50,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 03:38:50,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:50,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690173218] [2022-04-08 03:38:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690173218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:50,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 03:38:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26507621] [2022-04-08 03:38:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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 50 [2022-04-08 03:38:50,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:50,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-08 03:38:50,991 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-08 03:38:50,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 03:38:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 03:38:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:38:50,992 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-08 03:38:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:51,312 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-08 03:38:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:38:51,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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 50 [2022-04-08 03:38:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-08 03:38:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-08 03:38:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-08 03:38:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-08 03:38:51,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2022-04-08 03:38:51,366 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-08 03:38:51,367 INFO L225 Difference]: With dead ends: 83 [2022-04-08 03:38:51,367 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 03:38:51,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 03:38:51,368 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:51,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 26 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 03:38:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-08 03:38:51,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:51,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:51,426 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:51,426 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:51,427 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-08 03:38:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-08 03:38:51,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:51,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:51,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 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 57 states. [2022-04-08 03:38:51,428 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 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 57 states. [2022-04-08 03:38:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:51,428 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-08 03:38:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-08 03:38:51,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:51,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:51,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:51,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-08 03:38:51,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-04-08 03:38:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:51,429 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-08 03:38:51,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-08 03:38:51,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-08 03:38:51,479 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-08 03:38:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-08 03:38:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 03:38:51,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:51,480 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:51,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 03:38:51,686 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-08 03:38:51,686 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 19 times [2022-04-08 03:38:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:51,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864623501] [2022-04-08 03:38:51,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:51,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:51,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 20 times [2022-04-08 03:38:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:51,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439923356] [2022-04-08 03:38:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:51,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {4958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4942#true} is VALID [2022-04-08 03:38:51,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-08 03:38:51,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-08 03:38:51,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:51,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {4958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4942#true} is VALID [2022-04-08 03:38:51,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-08 03:38:51,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-08 03:38:51,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-08 03:38:51,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4947#(= main_~i~0 0)} is VALID [2022-04-08 03:38:51,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {4947#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4947#(= main_~i~0 0)} is VALID [2022-04-08 03:38:51,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {4947#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4948#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:51,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4948#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:51,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {4948#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4949#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:51,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4949#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:51,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4950#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:51,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4950#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:51,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {4950#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4951#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:51,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4951#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:51,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4952#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:51,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4952#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:51,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {4952#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4953#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:51,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4953#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:51,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {4953#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4954#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:51,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4954#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:51,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {4954#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4955#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:51,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4955#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:51,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {4955#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4956#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:51,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4956#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {4956#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4957#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-08 03:38:51,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-08 03:38:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 03:38:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439923356] [2022-04-08 03:38:51,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439923356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660099292] [2022-04-08 03:38:51,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:51,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:51,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:51,860 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-08 03:38:51,861 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-08 03:38:51,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:51,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:51,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:38:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:51,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:52,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-08 03:38:52,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4942#true} is VALID [2022-04-08 03:38:52,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-08 03:38:52,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-08 03:38:52,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-08 03:38:52,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4977#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:52,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4977#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:52,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {4977#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4948#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:52,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4948#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:52,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {4948#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4949#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:52,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4949#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:52,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4950#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:52,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4950#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:52,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {4950#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4951#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:52,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4951#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:52,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4952#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:52,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4952#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:52,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {4952#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4953#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:52,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4953#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:52,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {4953#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4954#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:52,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4954#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:52,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {4954#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4955#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:52,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4955#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:52,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {4955#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4956#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:52,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4956#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {4956#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4957#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:52,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-08 03:38:52,184 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-08 03:38:52,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-08 03:38:52,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-08 03:38:52,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-08 03:38:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 03:38:52,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:52,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-08 03:38:52,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-08 03:38:52,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-08 03:38:52,525 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-08 03:38:52,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-08 03:38:52,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-08 03:38:52,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {5203#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-08 03:38:52,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {5207#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5203#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:52,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {5207#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5207#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:52,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {5214#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5207#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:52,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {5214#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5214#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:52,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {5221#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5214#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:52,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {5221#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5221#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:52,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {5228#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5221#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:52,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {5228#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5228#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:52,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {5235#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:52,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {5235#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5235#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:52,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {5242#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5235#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:52,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {5242#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5242#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:52,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5249#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5242#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:52,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {5249#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5249#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:52,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {5256#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5249#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:52,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {5256#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5256#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:52,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {5263#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:52,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {5263#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5263#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:52,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5263#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:52,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5270#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:52,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5270#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:52,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-08 03:38:52,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-08 03:38:52,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-08 03:38:52,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4942#true} is VALID [2022-04-08 03:38:52,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-08 03:38:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 03:38:52,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660099292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:52,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 03:38:52,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864623501] [2022-04-08 03:38:52,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864623501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:52,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:38:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154905081] [2022-04-08 03:38:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 54 [2022-04-08 03:38:52,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:52,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-08 03:38:52,567 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-08 03:38:52,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:38:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:38:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-08 03:38:52,568 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-08 03:38:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:52,974 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-08 03:38:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 03:38:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 54 [2022-04-08 03:38:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-08 03:38:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-08 03:38:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-08 03:38:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-08 03:38:52,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-08 03:38:53,035 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-08 03:38:53,036 INFO L225 Difference]: With dead ends: 89 [2022-04-08 03:38:53,036 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 03:38:53,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 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-08 03:38:53,037 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:53,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 31 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 03:38:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-08 03:38:53,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:53,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:53,113 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:53,113 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:53,114 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 03:38:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 03:38:53,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:53,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:53,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 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 61 states. [2022-04-08 03:38:53,114 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 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 61 states. [2022-04-08 03:38:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:53,115 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 03:38:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 03:38:53,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:53,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:53,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:53,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-08 03:38:53,116 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-08 03:38:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:53,116 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-08 03:38:53,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-08 03:38:53,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-08 03:38:53,179 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-08 03:38:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-08 03:38:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 03:38:53,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:53,180 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:53,216 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-08 03:38:53,380 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-08 03:38:53,380 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 21 times [2022-04-08 03:38:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:53,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610625335] [2022-04-08 03:38:53,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:53,386 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:53,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 22 times [2022-04-08 03:38:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:53,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367069758] [2022-04-08 03:38:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:53,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {5751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5734#true} is VALID [2022-04-08 03:38:53,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-08 03:38:53,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-08 03:38:53,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:53,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {5751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5734#true} is VALID [2022-04-08 03:38:53,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-08 03:38:53,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-08 03:38:53,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-08 03:38:53,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5739#(= main_~i~0 0)} is VALID [2022-04-08 03:38:53,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {5739#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5739#(= main_~i~0 0)} is VALID [2022-04-08 03:38:53,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {5739#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5740#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:53,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5740#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:53,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5741#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:53,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {5741#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5741#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:53,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {5741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:53,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {5742#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5742#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:53,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {5742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5743#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:53,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5743#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:53,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5744#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:53,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {5744#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5744#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:53,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {5744#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5745#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:53,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {5745#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5745#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:53,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {5745#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5746#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:53,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {5746#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5746#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:53,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {5746#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5747#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:53,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {5747#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5747#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:53,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {5747#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5748#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:53,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {5748#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5748#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:53,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {5748#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5749#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:53,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {5749#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5749#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:53,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {5749#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5750#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-08 03:38:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 03:38:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367069758] [2022-04-08 03:38:53,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367069758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779032986] [2022-04-08 03:38:53,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:38:53,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:53,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:53,582 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-08 03:38:53,583 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-08 03:38:53,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:38:53,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:53,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 03:38:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:53,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-08 03:38:53,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5734#true} is VALID [2022-04-08 03:38:53,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-08 03:38:53,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-08 03:38:53,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-08 03:38:53,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5770#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:53,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {5770#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5770#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:53,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {5770#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5740#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:53,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5740#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:53,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5741#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:53,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {5741#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5741#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:53,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {5741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:53,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {5742#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5742#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:53,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {5742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5743#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:53,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5743#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:53,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5744#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:53,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {5744#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5744#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:53,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {5744#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5745#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:53,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {5745#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5745#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:53,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {5745#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5746#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:53,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {5746#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5746#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:53,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {5746#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5747#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:53,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {5747#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5747#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:53,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {5747#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5748#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:53,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {5748#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5748#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:53,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {5748#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5749#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:53,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {5749#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5749#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:53,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {5749#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5750#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-08 03:38:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 03:38:53,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:54,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-08 03:38:54,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-08 03:38:54,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {6014#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-08 03:38:54,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {6018#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6014#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:54,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {6018#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6018#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:54,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {6025#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6018#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:54,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {6025#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6025#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:54,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {6032#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6025#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:54,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6032#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6032#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:54,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {6039#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6032#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:54,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {6039#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6039#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:54,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {6046#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6039#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:54,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {6046#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6046#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:54,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {6053#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6046#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:54,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {6053#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6053#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:54,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {6060#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6053#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:54,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {6060#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6060#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:54,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6060#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:54,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6067#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:54,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {6074#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6067#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:54,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {6074#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6074#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:54,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {6081#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6074#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:54,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {6081#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6081#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:54,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {6088#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6081#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:54,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {6088#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6088#(< main_~i~0 2037)} is VALID [2022-04-08 03:38:54,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6088#(< main_~i~0 2037)} is VALID [2022-04-08 03:38:54,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-08 03:38:54,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-08 03:38:54,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-08 03:38:54,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5734#true} is VALID [2022-04-08 03:38:54,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-08 03:38:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 03:38:54,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779032986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:54,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:54,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 03:38:54,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:54,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610625335] [2022-04-08 03:38:54,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610625335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:54,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:54,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 03:38:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684564203] [2022-04-08 03:38:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:54,279 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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 58 [2022-04-08 03:38:54,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:54,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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-08 03:38:54,302 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-08 03:38:54,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 03:38:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 03:38:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-08 03:38:54,304 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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-08 03:38:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:54,670 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-08 03:38:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 03:38:54,670 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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 58 [2022-04-08 03:38:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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-08 03:38:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-08 03:38:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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-08 03:38:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-08 03:38:54,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 77 transitions. [2022-04-08 03:38:54,739 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-08 03:38:54,740 INFO L225 Difference]: With dead ends: 95 [2022-04-08 03:38:54,740 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 03:38:54,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 105 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-08 03:38:54,741 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:54,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 31 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:38:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 03:38:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-08 03:38:54,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:54,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:54,808 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:54,808 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:54,809 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-08 03:38:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-08 03:38:54,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:54,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:54,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 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 65 states. [2022-04-08 03:38:54,809 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 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 65 states. [2022-04-08 03:38:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:54,810 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-08 03:38:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-08 03:38:54,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:54,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:54,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:54,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:38:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-04-08 03:38:54,811 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-04-08 03:38:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:54,811 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-04-08 03:38:54,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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-08 03:38:54,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 64 transitions. [2022-04-08 03:38:54,864 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-08 03:38:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-08 03:38:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 03:38:54,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:54,865 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:54,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 03:38:55,071 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-08 03:38:55,071 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 23 times [2022-04-08 03:38:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012425926] [2022-04-08 03:38:55,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:55,077 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:55,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 24 times [2022-04-08 03:38:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:55,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771971821] [2022-04-08 03:38:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:55,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {6600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {6600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-08 03:38:55,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-08 03:38:55,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6587#(= main_~i~0 0)} is VALID [2022-04-08 03:38:55,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {6587#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6587#(= main_~i~0 0)} is VALID [2022-04-08 03:38:55,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {6587#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:55,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {6588#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6588#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:55,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {6588#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:55,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {6589#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6589#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:55,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {6589#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:55,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {6590#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6590#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:55,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {6590#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:55,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {6591#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6591#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:55,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {6591#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:55,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {6592#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6592#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:55,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:55,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {6593#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6593#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:55,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {6593#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:55,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {6594#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6594#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:55,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {6594#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:55,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {6595#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6595#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:55,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {6595#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6596#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:55,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {6596#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6596#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:55,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {6596#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6597#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:55,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {6597#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6597#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:55,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {6597#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6598#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:55,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {6598#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6598#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {6598#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6599#(<= main_~i~0 12)} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {6583#false} ~i~0 := 0; {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-08 03:38:55,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {6583#false} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-08 03:38:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 03:38:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:55,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771971821] [2022-04-08 03:38:55,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771971821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:55,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196351421] [2022-04-08 03:38:55,271 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:38:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:55,272 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-08 03:38:55,273 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-08 03:38:58,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 03:38:58,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:58,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 03:38:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:59,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:59,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6688#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:59,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {6688#(< main_~i~0 2048)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6692#(< main_~i~0 2049)} is VALID [2022-04-08 03:38:59,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {6692#(< main_~i~0 2049)} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-08 03:38:59,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6699#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:59,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {6699#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6699#(<= main_~i~0 0)} is VALID [2022-04-08 03:38:59,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {6699#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6588#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:59,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6588#(<= main_~i~0 1)} is VALID [2022-04-08 03:38:59,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {6588#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6589#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:59,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {6589#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6589#(<= main_~i~0 2)} is VALID [2022-04-08 03:38:59,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {6589#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6590#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:59,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {6590#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6590#(<= main_~i~0 3)} is VALID [2022-04-08 03:38:59,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {6590#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6591#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:59,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {6591#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6591#(<= main_~i~0 4)} is VALID [2022-04-08 03:38:59,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {6591#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6592#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:59,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {6592#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6592#(<= main_~i~0 5)} is VALID [2022-04-08 03:38:59,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {6592#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6593#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:59,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {6593#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6593#(<= main_~i~0 6)} is VALID [2022-04-08 03:38:59,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {6593#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6594#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:59,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {6594#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6594#(<= main_~i~0 7)} is VALID [2022-04-08 03:38:59,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {6594#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6595#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:59,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {6595#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6595#(<= main_~i~0 8)} is VALID [2022-04-08 03:38:59,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {6595#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6596#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:59,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {6596#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6596#(<= main_~i~0 9)} is VALID [2022-04-08 03:38:59,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {6596#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:59,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {6597#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6597#(<= main_~i~0 10)} is VALID [2022-04-08 03:38:59,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {6597#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6598#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:59,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {6598#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6598#(<= main_~i~0 11)} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {6598#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6599#(<= main_~i~0 12)} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-08 03:38:59,301 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-08 03:38:59,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-08 03:38:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 144 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 03:38:59,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:59,695 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-08 03:38:59,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-08 03:38:59,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-08 03:38:59,695 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-08 03:38:59,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-08 03:38:59,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {6688#(< main_~i~0 2048)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-08 03:38:59,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {6808#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6688#(< main_~i~0 2048)} is VALID [2022-04-08 03:38:59,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {6808#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:59,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {6815#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6808#(< main_~i~0 2047)} is VALID [2022-04-08 03:38:59,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {6815#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6815#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:59,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {6822#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6815#(< main_~i~0 2046)} is VALID [2022-04-08 03:38:59,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {6822#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6822#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:59,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {6829#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6822#(< main_~i~0 2045)} is VALID [2022-04-08 03:38:59,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {6829#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6829#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:59,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {6836#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6829#(< main_~i~0 2044)} is VALID [2022-04-08 03:38:59,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {6836#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6836#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:59,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {6843#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6836#(< main_~i~0 2043)} is VALID [2022-04-08 03:38:59,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {6843#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6843#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:59,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {6850#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6843#(< main_~i~0 2042)} is VALID [2022-04-08 03:38:59,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {6850#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6850#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:59,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {6857#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6850#(< main_~i~0 2041)} is VALID [2022-04-08 03:38:59,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {6857#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6857#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:59,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {6864#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6857#(< main_~i~0 2040)} is VALID [2022-04-08 03:38:59,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {6864#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6864#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:59,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {6871#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6864#(< main_~i~0 2039)} is VALID [2022-04-08 03:38:59,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {6871#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6871#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:59,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {6878#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6871#(< main_~i~0 2038)} is VALID [2022-04-08 03:38:59,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {6878#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6878#(< main_~i~0 2037)} is VALID [2022-04-08 03:38:59,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {6885#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6878#(< main_~i~0 2037)} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {6885#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6885#(< main_~i~0 2036)} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6885#(< main_~i~0 2036)} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {6582#true} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-08 03:38:59,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6582#true} is VALID [2022-04-08 03:38:59,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-08 03:38:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 03:38:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196351421] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:59,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 31 [2022-04-08 03:38:59,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:59,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012425926] [2022-04-08 03:38:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012425926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:59,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:38:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236619861] [2022-04-08 03:38:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 62 [2022-04-08 03:38:59,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:59,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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-08 03:38:59,731 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-08 03:38:59,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:38:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:38:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2022-04-08 03:38:59,732 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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-08 03:39:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:00,157 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-08 03:39:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 03:39:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 62 [2022-04-08 03:39:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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-08 03:39:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 03:39:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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-08 03:39:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 03:39:00,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-08 03:39:00,223 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-08 03:39:00,223 INFO L225 Difference]: With dead ends: 101 [2022-04-08 03:39:00,223 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 03:39:00,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=828, Invalid=1064, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 03:39:00,225 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:00,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 31 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 03:39:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-08 03:39:00,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:00,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:00,298 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:00,298 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:00,299 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 03:39:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 03:39:00,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:00,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:00,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 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 69 states. [2022-04-08 03:39:00,300 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 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 69 states. [2022-04-08 03:39:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:00,301 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 03:39:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 03:39:00,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:00,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:00,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:00,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-08 03:39:00,302 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-04-08 03:39:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:00,302 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-08 03:39:00,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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-08 03:39:00,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-08 03:39:00,362 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-08 03:39:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-08 03:39:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 03:39:00,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:00,362 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:00,382 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-08 03:39:00,563 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-08 03:39:00,563 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 25 times [2022-04-08 03:39:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:00,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1639203567] [2022-04-08 03:39:00,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:00,568 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:00,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 26 times [2022-04-08 03:39:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:00,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272628709] [2022-04-08 03:39:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:00,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {7506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7487#true} is VALID [2022-04-08 03:39:00,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-08 03:39:00,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-08 03:39:00,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:00,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {7506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7487#true} is VALID [2022-04-08 03:39:00,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-08 03:39:00,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-08 03:39:00,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-08 03:39:00,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7492#(= main_~i~0 0)} is VALID [2022-04-08 03:39:00,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {7492#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7492#(= main_~i~0 0)} is VALID [2022-04-08 03:39:00,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {7492#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:00,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {7493#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7493#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:00,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {7493#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:00,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {7494#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7494#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:00,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {7494#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:00,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {7495#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7495#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:00,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {7495#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:00,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7496#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:00,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {7496#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:00,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7497#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:00,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {7497#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:00,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7498#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:00,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {7498#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:00,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {7499#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7499#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:00,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {7499#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:00,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {7500#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7500#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:00,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {7500#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:00,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {7501#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7501#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:00,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {7501#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:00,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {7502#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7502#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:00,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {7502#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:00,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {7503#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7503#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:00,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {7503#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:00,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {7504#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7504#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {7504#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7505#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {7505#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:00,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-08 03:39:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-08 03:39:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:00,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272628709] [2022-04-08 03:39:00,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272628709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:00,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177081747] [2022-04-08 03:39:00,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:39:00,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:00,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:00,816 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-08 03:39:00,818 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-08 03:39:00,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:39:00,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:39:00,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:39:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:39:01,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7487#true} is VALID [2022-04-08 03:39:01,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7487#true} is VALID [2022-04-08 03:39:01,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-08 03:39:01,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-08 03:39:01,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-08 03:39:01,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7525#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:01,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {7525#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7525#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:01,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {7525#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:01,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {7493#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7493#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:01,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {7493#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:01,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {7494#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7494#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:01,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {7494#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:01,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {7495#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7495#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:01,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {7495#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:01,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7496#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:01,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {7496#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:01,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7497#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:01,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {7497#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:01,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7498#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:01,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {7498#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:01,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {7499#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7499#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:01,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {7499#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:01,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {7500#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7500#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:01,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {7500#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:01,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {7501#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7501#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:01,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {7501#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:01,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {7502#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7502#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:01,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {7502#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:01,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {7503#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7503#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:01,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {7503#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:01,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {7504#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7504#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:01,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {7504#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7505#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {7505#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-08 03:39:01,221 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-08 03:39:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-08 03:39:01,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,765 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-08 03:39:01,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-08 03:39:01,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {7805#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-08 03:39:01,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {7809#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7805#(< main_~i~0 2048)} is VALID [2022-04-08 03:39:01,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {7809#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7809#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:01,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {7816#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7809#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:01,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {7816#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7816#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:01,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {7823#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7816#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:01,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {7823#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7823#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:01,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {7830#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7823#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:01,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {7830#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7830#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:01,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {7837#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7830#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:01,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {7837#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7837#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:01,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {7844#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7837#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:01,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {7844#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7844#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:01,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {7851#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7844#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:01,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {7851#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7851#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:01,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {7858#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7851#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:01,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {7858#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7858#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:01,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {7865#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7858#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:01,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {7865#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7865#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:01,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {7872#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7865#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:01,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {7872#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7872#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:01,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {7879#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7872#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:01,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {7879#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7879#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:01,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {7886#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7879#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:01,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {7886#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7886#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:01,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {7893#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7886#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:01,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {7893#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7893#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:01,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7893#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:01,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-08 03:39:01,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-08 03:39:01,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-08 03:39:01,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7487#true} is VALID [2022-04-08 03:39:01,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7487#true} is VALID [2022-04-08 03:39:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-08 03:39:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177081747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:39:01,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:39:01,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 03:39:01,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:39:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1639203567] [2022-04-08 03:39:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1639203567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:39:01,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:39:01,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 03:39:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936664661] [2022-04-08 03:39:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:39:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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 66 [2022-04-08 03:39:01,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:39:01,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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-08 03:39:01,821 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-08 03:39:01,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 03:39:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:01,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 03:39:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:39:01,822 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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-08 03:39:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:02,260 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-08 03:39:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 03:39:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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 66 [2022-04-08 03:39:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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-08 03:39:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-08 03:39:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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-08 03:39:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-08 03:39:02,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 85 transitions. [2022-04-08 03:39:02,326 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-08 03:39:02,327 INFO L225 Difference]: With dead ends: 107 [2022-04-08 03:39:02,327 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 03:39:02,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 03:39:02,328 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:02,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 36 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 03:39:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-08 03:39:02,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:02,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:02,425 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:02,425 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:02,426 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-08 03:39:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-08 03:39:02,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:02,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:02,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 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 73 states. [2022-04-08 03:39:02,429 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 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 73 states. [2022-04-08 03:39:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:02,431 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-08 03:39:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-08 03:39:02,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:02,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:02,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:02,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-08 03:39:02,432 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2022-04-08 03:39:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:02,432 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-08 03:39:02,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 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-08 03:39:02,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-08 03:39:02,497 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-08 03:39:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-08 03:39:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 03:39:02,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:02,498 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:02,517 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-08 03:39:02,711 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-08 03:39:02,711 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 27 times [2022-04-08 03:39:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938805049] [2022-04-08 03:39:02,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:02,717 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:02,717 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 28 times [2022-04-08 03:39:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:02,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419071182] [2022-04-08 03:39:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:02,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {8467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8447#true} is VALID [2022-04-08 03:39:02,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-08 03:39:02,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-08 03:39:02,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:02,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {8467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8447#true} is VALID [2022-04-08 03:39:02,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-08 03:39:02,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-08 03:39:02,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-08 03:39:02,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8452#(= main_~i~0 0)} is VALID [2022-04-08 03:39:02,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {8452#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8452#(= main_~i~0 0)} is VALID [2022-04-08 03:39:02,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {8452#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:02,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {8453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8453#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:02,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {8453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:02,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {8454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8454#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:02,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {8454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:02,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {8455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8455#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:02,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {8455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:02,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {8456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8456#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:02,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {8456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:02,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {8457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8457#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:02,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {8457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:02,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {8458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8458#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:02,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:02,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8459#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:02,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {8459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:02,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {8460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8460#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:02,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {8460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:02,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {8461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8461#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:02,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {8461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:02,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {8462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8462#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:02,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {8462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:02,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {8463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8463#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:02,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {8463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:02,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {8464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8464#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:02,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {8464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:02,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {8465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8465#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {8465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {8466#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-08 03:39:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 03:39:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419071182] [2022-04-08 03:39:02,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419071182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926413314] [2022-04-08 03:39:02,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:39:02,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:02,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:02,940 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-08 03:39:02,941 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-08 03:39:03,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:39:03,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:39:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 03:39:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:03,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:39:03,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-08 03:39:03,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8447#true} is VALID [2022-04-08 03:39:03,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-08 03:39:03,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-08 03:39:03,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-08 03:39:03,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8486#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:03,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {8486#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8486#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:03,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {8486#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:03,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {8453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8453#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:03,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {8453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:03,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {8454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8454#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:03,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {8454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:03,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {8455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8455#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:03,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {8455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:03,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {8456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8456#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:03,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {8456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:03,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {8457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8457#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:03,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {8457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:03,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {8458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8458#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:03,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:03,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8459#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:03,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {8459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:03,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {8460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8460#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:03,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {8460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:03,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {8461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8461#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:03,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {8461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:03,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {8462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8462#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:03,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {8462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:03,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {8463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8463#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:03,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {8463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:03,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {8464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8464#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:03,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {8464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:03,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {8465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8465#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:03,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {8465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {8466#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-08 03:39:03,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-08 03:39:03,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-08 03:39:03,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-08 03:39:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 03:39:03,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-08 03:39:03,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-08 03:39:03,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {8784#(< main_~i~0 2048)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-08 03:39:03,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {8788#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8784#(< main_~i~0 2048)} is VALID [2022-04-08 03:39:03,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {8788#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8788#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:03,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {8795#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8788#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:03,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {8795#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8795#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:03,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {8802#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8795#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:03,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {8802#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8802#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:03,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {8809#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8802#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:03,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {8809#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8809#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:03,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {8816#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8809#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:03,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {8816#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8816#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:03,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {8823#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8816#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:03,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {8823#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8823#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:03,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {8830#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8823#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:03,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {8830#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8830#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:03,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {8837#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8830#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:03,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {8837#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8837#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:03,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {8844#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8837#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:03,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {8844#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8844#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:03,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {8851#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8844#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:03,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {8851#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8851#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:03,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {8858#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8851#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:03,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {8858#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8858#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:03,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {8865#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8858#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:03,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {8865#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8865#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:03,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {8872#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8865#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:03,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {8872#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8872#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:03,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {8879#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8872#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:03,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {8879#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8879#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:03,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8879#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:03,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-08 03:39:03,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-08 03:39:03,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-08 03:39:03,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8447#true} is VALID [2022-04-08 03:39:03,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-08 03:39:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 03:39:03,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926413314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:39:03,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:39:03,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 03:39:03,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:39:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938805049] [2022-04-08 03:39:03,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938805049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:39:03,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:39:03,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 03:39:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472887746] [2022-04-08 03:39:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:39:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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 70 [2022-04-08 03:39:03,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:39:03,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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-08 03:39:03,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-08 03:39:03,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 03:39:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 03:39:03,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 03:39:03,902 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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-08 03:39:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:04,355 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-08 03:39:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 03:39:04,356 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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 70 [2022-04-08 03:39:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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-08 03:39:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-08 03:39:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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-08 03:39:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-08 03:39:04,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-08 03:39:04,427 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-08 03:39:04,428 INFO L225 Difference]: With dead ends: 113 [2022-04-08 03:39:04,428 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 03:39:04,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 03:39:04,430 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:04,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 03:39:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-08 03:39:04,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:04,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:04,554 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:04,554 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:04,555 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 03:39:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 03:39:04,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:04,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:04,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 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 77 states. [2022-04-08 03:39:04,558 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 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 77 states. [2022-04-08 03:39:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:04,559 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 03:39:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 03:39:04,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:04,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:04,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:04,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-04-08 03:39:04,560 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2022-04-08 03:39:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:04,561 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-04-08 03:39:04,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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-08 03:39:04,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 76 transitions. [2022-04-08 03:39:04,624 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-08 03:39:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-04-08 03:39:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 03:39:04,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:04,624 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:04,641 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-08 03:39:04,831 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-08 03:39:04,831 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 29 times [2022-04-08 03:39:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:04,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25899719] [2022-04-08 03:39:04,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:04,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:04,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 30 times [2022-04-08 03:39:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333151399] [2022-04-08 03:39:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:05,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9463#true} is VALID [2022-04-08 03:39:05,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-08 03:39:05,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-08 03:39:05,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:05,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9463#true} is VALID [2022-04-08 03:39:05,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-08 03:39:05,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-08 03:39:05,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-08 03:39:05,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9468#(= main_~i~0 0)} is VALID [2022-04-08 03:39:05,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {9468#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9468#(= main_~i~0 0)} is VALID [2022-04-08 03:39:05,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {9468#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:05,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9469#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:05,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:05,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9470#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:05,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:05,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9471#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:05,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:05,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9472#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:05,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:05,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9473#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:05,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:05,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9474#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:05,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:05,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9475#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:05,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:05,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9476#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:05,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:05,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9477#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:05,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:05,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9478#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:05,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:05,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9479#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:05,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:05,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9480#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:05,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:05,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9481#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:05,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:05,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9482#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:05,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:05,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-08 03:39:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-08 03:39:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333151399] [2022-04-08 03:39:05,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333151399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780072948] [2022-04-08 03:39:05,111 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:39:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:05,112 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-08 03:39:05,123 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-08 03:39:25,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 03:39:25,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:39:25,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 03:39:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:25,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:39:25,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-08 03:39:25,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9463#true} is VALID [2022-04-08 03:39:25,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-08 03:39:25,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-08 03:39:25,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-08 03:39:25,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:25,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9503#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:25,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:25,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9469#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:25,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:25,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9470#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:25,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:25,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9471#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:25,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:25,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9472#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:25,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:25,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9473#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:25,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:25,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9474#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:25,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:25,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9475#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:25,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:25,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9476#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:25,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:25,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9477#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:25,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:25,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9478#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:25,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:25,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9479#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:25,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:25,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9480#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:25,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:25,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9481#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:25,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:25,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9482#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-08 03:39:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-08 03:39:25,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:39:26,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-08 03:39:26,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-08 03:39:26,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-08 03:39:26,549 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-08 03:39:26,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-08 03:39:26,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-08 03:39:26,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {9819#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-08 03:39:26,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9819#(< main_~i~0 2048)} is VALID [2022-04-08 03:39:26,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {9823#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9823#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:26,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {9830#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9823#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:26,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {9830#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9830#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:26,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {9837#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9830#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:26,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {9837#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9837#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:26,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {9844#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9837#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:26,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {9844#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9844#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:26,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {9851#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9844#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:26,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {9851#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9851#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:26,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {9858#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9851#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:26,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {9858#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9858#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:26,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {9865#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9858#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:26,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {9865#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9865#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:26,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {9872#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9865#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:26,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {9872#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9872#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:26,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {9879#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9872#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:26,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {9879#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9879#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:26,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {9886#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9879#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:26,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {9886#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9886#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:26,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {9893#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9886#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:26,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {9893#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9893#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:26,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {9900#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9893#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:26,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {9900#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9900#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:26,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9900#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:26,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9907#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:26,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {9914#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9907#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:26,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {9914#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9914#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:26,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {9921#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9914#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:26,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {9921#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9921#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:26,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9921#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:26,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-08 03:39:26,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-08 03:39:26,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-08 03:39:26,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9463#true} is VALID [2022-04-08 03:39:26,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-08 03:39:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-08 03:39:26,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780072948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:39:26,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:39:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 03:39:26,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:39:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25899719] [2022-04-08 03:39:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25899719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:39:26,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:39:26,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 03:39:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035742302] [2022-04-08 03:39:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:39:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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 74 [2022-04-08 03:39:26,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:39:26,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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-08 03:39:26,593 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-08 03:39:26,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 03:39:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 03:39:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 03:39:26,596 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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-08 03:39:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:27,084 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-08 03:39:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 03:39:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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 74 [2022-04-08 03:39:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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-08 03:39:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-08 03:39:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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-08 03:39:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-08 03:39:27,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-08 03:39:27,201 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-08 03:39:27,202 INFO L225 Difference]: With dead ends: 119 [2022-04-08 03:39:27,202 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 03:39:27,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 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-08 03:39:27,203 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 104 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:27,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 26 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 03:39:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 03:39:27,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:27,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:27,316 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:27,322 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:27,326 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-08 03:39:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-08 03:39:27,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:27,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:27,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 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 81 states. [2022-04-08 03:39:27,327 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 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 81 states. [2022-04-08 03:39:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:27,328 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-08 03:39:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-08 03:39:27,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:27,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:27,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:27,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-08 03:39:27,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-08 03:39:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:27,329 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-08 03:39:27,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 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-08 03:39:27,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-08 03:39:27,399 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-08 03:39:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-08 03:39:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 03:39:27,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:27,400 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:27,425 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-08 03:39:27,600 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-08 03:39:27,601 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 31 times [2022-04-08 03:39:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:27,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1588774033] [2022-04-08 03:39:27,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:27,611 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:27,611 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 32 times [2022-04-08 03:39:27,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:27,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149896267] [2022-04-08 03:39:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:27,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {10557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10535#true} is VALID [2022-04-08 03:39:27,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:27,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {10557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-08 03:39:27,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10540#(= main_~i~0 0)} is VALID [2022-04-08 03:39:27,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {10540#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10540#(= main_~i~0 0)} is VALID [2022-04-08 03:39:27,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {10540#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:27,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {10541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10541#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:27,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {10541#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:27,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {10542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10542#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:27,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {10542#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:27,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {10543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10543#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:27,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {10543#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:27,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {10544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10544#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:27,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {10544#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:27,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {10545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10545#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:27,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {10545#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:27,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {10546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10546#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:27,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {10546#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:27,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {10547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10547#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:27,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {10547#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:27,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {10548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10548#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:27,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:27,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10549#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:27,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:27,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {10550#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10550#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:27,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {10550#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:27,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {10551#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10551#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:27,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {10551#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:27,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10552#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:27,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:27,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {10553#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10553#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:27,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {10553#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:27,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {10554#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10554#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:27,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {10554#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:27,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {10555#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10555#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {10555#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10556#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {10556#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-08 03:39:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-08 03:39:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:27,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149896267] [2022-04-08 03:39:27,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149896267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:27,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796465033] [2022-04-08 03:39:27,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:39:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:27,864 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-08 03:39:27,865 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-08 03:39:28,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:39:28,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:39:28,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 03:39:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:28,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:39:28,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10535#true} is VALID [2022-04-08 03:39:28,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10535#true} is VALID [2022-04-08 03:39:28,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-08 03:39:28,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-08 03:39:28,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-08 03:39:28,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10576#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:28,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {10576#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10576#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:28,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {10576#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:28,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {10541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10541#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:28,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {10541#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:28,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {10542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10542#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:28,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {10542#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:28,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {10543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10543#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:28,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {10543#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:28,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {10544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10544#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:28,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {10544#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:28,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {10545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10545#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:28,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {10545#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:28,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {10546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10546#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:28,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {10546#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:28,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {10547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10547#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:28,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {10547#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:28,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {10548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10548#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:28,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:28,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10549#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:28,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:28,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {10550#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10550#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:28,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {10550#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:28,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {10551#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10551#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:28,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {10551#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:28,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10552#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:28,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:28,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {10553#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10553#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:28,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {10553#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:28,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {10554#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10554#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:28,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {10554#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:28,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {10555#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10555#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {10555#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10556#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {10556#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-08 03:39:28,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-08 03:39:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-08 03:39:28,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-08 03:39:28,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-08 03:39:28,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-08 03:39:28,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {10910#(< main_~i~0 2048)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-08 03:39:28,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {10914#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10910#(< main_~i~0 2048)} is VALID [2022-04-08 03:39:28,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {10914#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10914#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:28,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {10921#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10914#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:28,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {10921#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10921#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:28,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {10928#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10921#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:28,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {10928#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10928#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:28,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {10935#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10928#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:28,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {10935#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10935#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:28,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {10942#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10935#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:28,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {10942#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10942#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:28,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {10949#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10942#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:28,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {10949#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10949#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:28,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {10956#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10949#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:28,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {10956#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10956#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:28,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {10963#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10956#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:28,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {10963#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10963#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:28,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {10970#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10963#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:28,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {10970#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10970#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:28,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {10977#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10970#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:28,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {10977#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10977#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:28,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {10984#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10977#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:28,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {10984#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10984#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:28,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {10991#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10984#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:28,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {10991#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10991#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:28,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {10998#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10991#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:28,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {10998#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10998#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:28,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {11005#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10998#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:28,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11005#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:28,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {11012#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11005#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:28,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {11012#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11012#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:28,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {11019#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11012#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:28,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {11019#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11019#(< main_~i~0 2032)} is VALID [2022-04-08 03:39:28,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11019#(< main_~i~0 2032)} is VALID [2022-04-08 03:39:28,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-08 03:39:28,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-08 03:39:28,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-08 03:39:28,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10535#true} is VALID [2022-04-08 03:39:28,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10535#true} is VALID [2022-04-08 03:39:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-08 03:39:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796465033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:39:28,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:39:28,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 03:39:28,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:39:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1588774033] [2022-04-08 03:39:28,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1588774033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:39:28,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:39:28,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 03:39:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792123376] [2022-04-08 03:39:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:39:28,991 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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 78 [2022-04-08 03:39:28,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:39:28,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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-08 03:39:29,024 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-08 03:39:29,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 03:39:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 03:39:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 03:39:29,025 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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-08 03:39:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:29,629 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-08 03:39:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 03:39:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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 78 [2022-04-08 03:39:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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-08 03:39:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-08 03:39:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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-08 03:39:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-08 03:39:29,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 97 transitions. [2022-04-08 03:39:29,698 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-08 03:39:29,699 INFO L225 Difference]: With dead ends: 125 [2022-04-08 03:39:29,699 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 03:39:29,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 140 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-08 03:39:29,700 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:29,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 26 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 03:39:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-08 03:39:29,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:29,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:29,815 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:29,815 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:29,816 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 03:39:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 03:39:29,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:29,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:29,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 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 85 states. [2022-04-08 03:39:29,816 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 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 85 states. [2022-04-08 03:39:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:29,817 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 03:39:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 03:39:29,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:29,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:29,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:29,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-04-08 03:39:29,818 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-04-08 03:39:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:29,819 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-04-08 03:39:29,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 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-08 03:39:29,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 84 transitions. [2022-04-08 03:39:29,917 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-08 03:39:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-08 03:39:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 03:39:29,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:29,918 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:29,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 03:39:30,119 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-08 03:39:30,119 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 33 times [2022-04-08 03:39:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017994713] [2022-04-08 03:39:30,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:30,126 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:30,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 34 times [2022-04-08 03:39:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:30,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926711119] [2022-04-08 03:39:30,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:30,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {11686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11663#true} is VALID [2022-04-08 03:39:30,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-08 03:39:30,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-08 03:39:30,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:30,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {11686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11663#true} is VALID [2022-04-08 03:39:30,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-08 03:39:30,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-08 03:39:30,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-08 03:39:30,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11668#(= main_~i~0 0)} is VALID [2022-04-08 03:39:30,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {11668#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11668#(= main_~i~0 0)} is VALID [2022-04-08 03:39:30,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {11668#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11669#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:30,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {11669#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11669#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:30,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {11669#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11670#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:30,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {11670#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11670#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:30,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {11670#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11671#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:30,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {11671#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11671#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:30,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {11671#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11672#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:30,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {11672#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11672#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:30,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {11672#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11673#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:30,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {11673#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11673#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:30,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {11673#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11674#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:30,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {11674#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11674#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:30,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {11674#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11675#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:30,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {11675#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11675#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:30,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {11675#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11676#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:30,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {11676#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11676#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:30,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {11676#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11677#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:30,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {11677#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11677#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:30,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {11677#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11678#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:30,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {11678#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11678#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:30,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {11678#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11679#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:30,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {11679#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11679#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:30,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {11679#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11680#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:30,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {11680#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11680#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:30,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {11680#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11681#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:30,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {11681#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11681#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:30,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {11681#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11682#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:30,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {11682#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11682#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:30,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {11682#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11683#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:30,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {11683#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11683#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:30,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {11683#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11684#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {11684#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11684#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {11684#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11685#(<= main_~i~0 17)} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {11685#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {11664#false} ~i~0 := 0; {11664#false} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {11664#false} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-08 03:39:30,398 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-08 03:39:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-08 03:39:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:30,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926711119] [2022-04-08 03:39:30,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926711119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:30,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891346922] [2022-04-08 03:39:30,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:39:30,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:30,400 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-08 03:39:30,412 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-08 03:39:30,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:39:30,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:39:30,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 03:39:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:30,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:39:30,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11663#true} is VALID [2022-04-08 03:39:30,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11663#true} is VALID [2022-04-08 03:39:30,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-08 03:39:30,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-08 03:39:30,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:30,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {11663#true} assume !(~i~0 < 2048); {11663#true} is VALID [2022-04-08 03:39:30,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {11663#true} ~i~0 := 0; {11813#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:30,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {11813#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11813#(<= main_~i~0 0)} is VALID [2022-04-08 03:39:30,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {11813#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11669#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:30,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {11669#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11669#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:30,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {11669#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11670#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:30,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {11670#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11670#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:30,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {11670#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11671#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:30,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {11671#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11671#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:30,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {11671#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11672#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:30,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {11672#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11672#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:30,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {11672#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11673#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:30,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {11673#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11673#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:30,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {11673#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11674#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:30,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {11674#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11674#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:30,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {11674#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11675#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:30,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {11675#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11675#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:30,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {11675#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11676#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:30,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {11676#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11676#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:30,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {11676#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11677#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:30,954 INFO L290 TraceCheckUtils]: 60: Hoare triple {11677#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11677#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:30,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {11677#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11678#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:30,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {11678#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11678#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:30,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {11678#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11679#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:30,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {11679#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11679#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:30,955 INFO L290 TraceCheckUtils]: 65: Hoare triple {11679#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11680#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:30,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {11680#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11680#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:30,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {11680#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11681#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:30,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {11681#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11681#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:30,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {11681#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11682#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:30,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {11682#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11682#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:30,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {11682#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11683#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:30,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {11683#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11683#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:30,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {11683#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11684#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {11684#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11684#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {11684#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11685#(<= main_~i~0 17)} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 76: Hoare triple {11685#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-08 03:39:30,958 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-08 03:39:30,958 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-08 03:39:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-08 03:39:30,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:39:31,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-08 03:39:31,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-08 03:39:31,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-08 03:39:31,538 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-08 03:39:31,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-08 03:39:31,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {11949#(< main_~i~0 2048)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-08 03:39:31,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {11953#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11949#(< main_~i~0 2048)} is VALID [2022-04-08 03:39:31,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {11953#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11953#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:31,540 INFO L290 TraceCheckUtils]: 73: Hoare triple {11960#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11953#(< main_~i~0 2047)} is VALID [2022-04-08 03:39:31,540 INFO L290 TraceCheckUtils]: 72: Hoare triple {11960#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11960#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:31,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {11967#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11960#(< main_~i~0 2046)} is VALID [2022-04-08 03:39:31,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {11967#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11967#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:31,541 INFO L290 TraceCheckUtils]: 69: Hoare triple {11974#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11967#(< main_~i~0 2045)} is VALID [2022-04-08 03:39:31,541 INFO L290 TraceCheckUtils]: 68: Hoare triple {11974#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11974#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:31,541 INFO L290 TraceCheckUtils]: 67: Hoare triple {11981#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11974#(< main_~i~0 2044)} is VALID [2022-04-08 03:39:31,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {11981#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11981#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:31,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {11988#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11981#(< main_~i~0 2043)} is VALID [2022-04-08 03:39:31,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {11988#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11988#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:31,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {11995#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11988#(< main_~i~0 2042)} is VALID [2022-04-08 03:39:31,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {11995#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11995#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:31,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {12002#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11995#(< main_~i~0 2041)} is VALID [2022-04-08 03:39:31,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {12002#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12002#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:31,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {12009#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12002#(< main_~i~0 2040)} is VALID [2022-04-08 03:39:31,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {12009#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12009#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:31,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {12016#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12009#(< main_~i~0 2039)} is VALID [2022-04-08 03:39:31,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {12016#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12016#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:31,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {12023#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12016#(< main_~i~0 2038)} is VALID [2022-04-08 03:39:31,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {12023#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12023#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:31,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {12030#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12023#(< main_~i~0 2037)} is VALID [2022-04-08 03:39:31,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {12030#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12030#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:31,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {12037#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12030#(< main_~i~0 2036)} is VALID [2022-04-08 03:39:31,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {12037#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12037#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:31,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {12044#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12037#(< main_~i~0 2035)} is VALID [2022-04-08 03:39:31,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {12044#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12044#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:31,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {12051#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12044#(< main_~i~0 2034)} is VALID [2022-04-08 03:39:31,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {12051#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12051#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:31,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {12058#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12051#(< main_~i~0 2033)} is VALID [2022-04-08 03:39:31,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {12058#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12058#(< main_~i~0 2032)} is VALID [2022-04-08 03:39:31,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {12065#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12058#(< main_~i~0 2032)} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {12065#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12065#(< main_~i~0 2031)} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {11663#true} ~i~0 := 0; {12065#(< main_~i~0 2031)} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {11663#true} assume !(~i~0 < 2048); {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11663#true} is VALID [2022-04-08 03:39:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-08 03:39:31,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891346922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:39:31,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:39:31,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 03:39:31,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:39:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017994713] [2022-04-08 03:39:31,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017994713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:39:31,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:39:31,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 03:39:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158491778] [2022-04-08 03:39:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:39:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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 82 [2022-04-08 03:39:31,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:39:31,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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-08 03:39:31,590 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-08 03:39:31,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 03:39:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 03:39:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 03:39:31,591 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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-08 03:39:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:32,234 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-08 03:39:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 03:39:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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 82 [2022-04-08 03:39:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:39:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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-08 03:39:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-08 03:39:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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-08 03:39:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-08 03:39:32,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 101 transitions. [2022-04-08 03:39:32,314 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-08 03:39:32,315 INFO L225 Difference]: With dead ends: 131 [2022-04-08 03:39:32,315 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 03:39:32,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 03:39:32,317 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:39:32,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 41 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:39:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 03:39:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-08 03:39:32,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:39:32,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:32,460 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:32,460 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:32,461 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-08 03:39:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-08 03:39:32,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:32,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:32,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 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 89 states. [2022-04-08 03:39:32,461 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 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 89 states. [2022-04-08 03:39:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:39:32,462 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-08 03:39:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-08 03:39:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:39:32,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:39:32,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:39:32,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:39:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:39:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-08 03:39:32,463 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-04-08 03:39:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:39:32,463 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-08 03:39:32,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 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-08 03:39:32,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-08 03:39:32,559 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-08 03:39:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-08 03:39:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 03:39:32,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:39:32,560 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:39:32,583 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-08 03:39:32,778 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-08 03:39:32,778 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:39:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:39:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 35 times [2022-04-08 03:39:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:39:32,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1830410735] [2022-04-08 03:39:32,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:39:32,783 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:39:32,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:39:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 36 times [2022-04-08 03:39:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:39:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277389458] [2022-04-08 03:39:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:39:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:39:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:39:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:39:33,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {12871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12847#true} is VALID [2022-04-08 03:39:33,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-08 03:39:33,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-08 03:39:33,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:39:33,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {12871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12847#true} is VALID [2022-04-08 03:39:33,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-08 03:39:33,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-08 03:39:33,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-08 03:39:33,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12852#(= main_~i~0 0)} is VALID [2022-04-08 03:39:33,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {12852#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12852#(= main_~i~0 0)} is VALID [2022-04-08 03:39:33,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {12852#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:33,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {12853#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12853#(<= main_~i~0 1)} is VALID [2022-04-08 03:39:33,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {12853#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:33,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {12854#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12854#(<= main_~i~0 2)} is VALID [2022-04-08 03:39:33,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {12854#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:33,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {12855#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12855#(<= main_~i~0 3)} is VALID [2022-04-08 03:39:33,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {12855#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:33,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {12856#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12856#(<= main_~i~0 4)} is VALID [2022-04-08 03:39:33,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {12856#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:33,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {12857#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12857#(<= main_~i~0 5)} is VALID [2022-04-08 03:39:33,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {12857#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:33,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {12858#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12858#(<= main_~i~0 6)} is VALID [2022-04-08 03:39:33,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {12858#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:33,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {12859#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12859#(<= main_~i~0 7)} is VALID [2022-04-08 03:39:33,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:33,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {12860#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12860#(<= main_~i~0 8)} is VALID [2022-04-08 03:39:33,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {12860#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:33,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {12861#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12861#(<= main_~i~0 9)} is VALID [2022-04-08 03:39:33,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {12861#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:33,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {12862#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12862#(<= main_~i~0 10)} is VALID [2022-04-08 03:39:33,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {12862#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:33,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {12863#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12863#(<= main_~i~0 11)} is VALID [2022-04-08 03:39:33,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {12863#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:33,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {12864#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12864#(<= main_~i~0 12)} is VALID [2022-04-08 03:39:33,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {12864#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:33,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {12865#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12865#(<= main_~i~0 13)} is VALID [2022-04-08 03:39:33,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {12865#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:33,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {12866#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12866#(<= main_~i~0 14)} is VALID [2022-04-08 03:39:33,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:33,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12867#(<= main_~i~0 15)} is VALID [2022-04-08 03:39:33,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {12867#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:33,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {12868#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12868#(<= main_~i~0 16)} is VALID [2022-04-08 03:39:33,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {12868#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 17)} is VALID [2022-04-08 03:39:33,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12869#(<= main_~i~0 17)} is VALID [2022-04-08 03:39:33,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12870#(<= main_~i~0 18)} is VALID [2022-04-08 03:39:33,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {12870#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:39:33,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-08 03:39:33,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-08 03:39:33,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-08 03:39:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 03:39:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:39:33,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277389458] [2022-04-08 03:39:33,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277389458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:39:33,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71314624] [2022-04-08 03:39:33,086 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:39:33,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:39:33,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:39:33,100 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-08 03:39:33,127 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-08 03:40:13,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 03:40:13,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:40:13,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 03:40:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:13,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:40:13,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12847#true} is VALID [2022-04-08 03:40:13,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12847#true} is VALID [2022-04-08 03:40:13,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-08 03:40:13,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-08 03:40:13,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-08 03:40:13,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12890#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:13,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {12890#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12890#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:13,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {12890#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:13,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {12853#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12853#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:13,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {12853#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:13,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {12854#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12854#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:13,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {12854#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:13,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {12855#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12855#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:13,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {12855#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:13,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {12856#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12856#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:13,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {12856#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:13,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {12857#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12857#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:13,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {12857#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:13,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {12858#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12858#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:13,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {12858#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:13,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {12859#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12859#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:13,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:13,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {12860#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12860#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:13,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {12860#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:13,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {12861#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12861#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:13,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {12861#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:13,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {12862#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12862#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:13,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {12862#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:13,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {12863#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12863#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:13,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {12863#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:13,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {12864#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12864#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:13,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {12864#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:13,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {12865#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12865#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:13,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {12865#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:13,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {12866#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12866#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:13,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:13,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12867#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:13,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {12867#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:13,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {12868#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12868#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:13,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {12868#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:13,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12869#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:13,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12870#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {12870#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:13,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-08 03:40:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 03:40:13,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-08 03:40:14,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-08 03:40:14,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {13260#(< main_~i~0 2048)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-08 03:40:14,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {13264#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13260#(< main_~i~0 2048)} is VALID [2022-04-08 03:40:14,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {13264#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13264#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:14,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13264#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:14,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13271#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:14,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {13278#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13271#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:14,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {13278#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13278#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:14,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {13285#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13278#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:14,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {13285#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13285#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:14,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {13292#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13285#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:14,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {13292#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13292#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:14,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {13299#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13292#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:14,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {13299#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13299#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:14,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13299#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:14,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {13306#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13306#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:14,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {13313#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13306#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:14,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {13313#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13313#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:14,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {13320#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13313#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:14,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {13320#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13320#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:14,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {13327#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13320#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:14,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {13327#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13327#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:14,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {13334#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13327#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:14,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {13334#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13334#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:14,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {13341#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13334#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:14,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {13341#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13341#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:14,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {13348#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13341#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:14,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {13348#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13348#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:14,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {13355#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13348#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:14,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {13355#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13355#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:14,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {13362#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13355#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:14,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {13362#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13362#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:14,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {13369#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13362#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:14,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {13369#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13369#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:14,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {13376#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13369#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:14,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {13376#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13376#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:14,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {13383#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13376#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:14,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {13383#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13383#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:14,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13383#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:14,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-08 03:40:14,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-08 03:40:14,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-08 03:40:14,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12847#true} is VALID [2022-04-08 03:40:14,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12847#true} is VALID [2022-04-08 03:40:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 03:40:14,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71314624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:40:14,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:40:14,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 03:40:14,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:40:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1830410735] [2022-04-08 03:40:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1830410735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:40:14,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:40:14,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 03:40:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686064064] [2022-04-08 03:40:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:40:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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 86 [2022-04-08 03:40:14,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:40:14,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-08 03:40:14,220 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-08 03:40:14,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 03:40:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 03:40:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 03:40:14,221 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-08 03:40:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:14,839 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-08 03:40:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 03:40:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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 86 [2022-04-08 03:40:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:40:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-08 03:40:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-08 03:40:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-08 03:40:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-08 03:40:14,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2022-04-08 03:40:14,955 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-08 03:40:14,956 INFO L225 Difference]: With dead ends: 137 [2022-04-08 03:40:14,956 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 03:40:14,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 03:40:14,958 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:40:14,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 41 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:40:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 03:40:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-08 03:40:15,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:40:15,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:15,102 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:15,102 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:15,103 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-08 03:40:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-08 03:40:15,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:15,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:15,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-08 03:40:15,104 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-08 03:40:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:15,105 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-08 03:40:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-08 03:40:15,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:15,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:15,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:40:15,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:40:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-08 03:40:15,106 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2022-04-08 03:40:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:40:15,106 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-08 03:40:15,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-08 03:40:15,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-08 03:40:15,194 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-08 03:40:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-08 03:40:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 03:40:15,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:40:15,195 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:40:15,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 03:40:15,411 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-08 03:40:15,411 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:40:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:40:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 37 times [2022-04-08 03:40:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:15,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41736582] [2022-04-08 03:40:15,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:40:15,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:40:15,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:40:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 38 times [2022-04-08 03:40:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:40:15,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124093755] [2022-04-08 03:40:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:40:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:40:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:15,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {14112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:40:15,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {14112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-08 03:40:15,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-08 03:40:15,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14092#(= main_~i~0 0)} is VALID [2022-04-08 03:40:15,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {14092#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14092#(= main_~i~0 0)} is VALID [2022-04-08 03:40:15,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {14092#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:15,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {14093#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14093#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:15,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {14093#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:15,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {14094#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14094#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:15,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {14094#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:15,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {14095#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14095#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:15,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {14095#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {14096#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14096#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:15,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {14096#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:15,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {14097#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14097#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:15,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {14097#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:15,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {14098#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14098#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:15,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {14098#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:15,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {14099#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14099#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:15,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:15,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {14100#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14100#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:15,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {14100#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:15,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {14101#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14101#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:15,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:15,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {14102#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14102#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:15,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {14102#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:15,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {14103#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14103#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:15,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {14103#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:15,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {14104#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14104#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:15,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {14104#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:15,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {14105#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14105#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:15,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {14105#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:15,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {14106#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14106#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:15,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {14106#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:15,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {14107#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14107#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:15,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {14107#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:15,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {14108#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14108#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:15,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:15,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {14109#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14109#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:15,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {14109#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:15,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {14110#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14110#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:15,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {14110#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14111#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {14111#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-08 03:40:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-08 03:40:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:40:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124093755] [2022-04-08 03:40:15,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124093755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:40:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235213524] [2022-04-08 03:40:15,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:40:15,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:40:15,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:40:15,742 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-08 03:40:15,745 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-08 03:40:15,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:40:15,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:40:15,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 03:40:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:16,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:40:16,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14087#true} is VALID [2022-04-08 03:40:16,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14087#true} is VALID [2022-04-08 03:40:16,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-08 03:40:16,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-08 03:40:16,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-08 03:40:16,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14131#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:16,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {14131#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14131#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:16,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {14131#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:16,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {14093#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14093#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:16,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {14093#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:16,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {14094#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14094#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:16,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {14094#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:16,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {14095#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14095#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:16,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {14095#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:16,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {14096#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14096#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:16,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {14096#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:16,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {14097#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14097#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:16,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {14097#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:16,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {14098#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14098#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:16,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {14098#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:16,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {14099#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14099#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:16,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:16,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {14100#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14100#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:16,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {14100#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:16,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {14101#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14101#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:16,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:16,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {14102#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14102#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:16,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {14102#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:16,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {14103#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14103#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:16,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {14103#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:16,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {14104#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14104#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:16,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {14104#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:16,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {14105#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14105#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:16,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {14105#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:16,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {14106#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14106#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:16,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {14106#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:16,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {14107#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14107#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:16,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {14107#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:16,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {14108#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14108#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:16,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:16,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {14109#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14109#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:16,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {14109#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:16,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {14110#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14110#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {14110#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14111#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {14111#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-08 03:40:16,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-08 03:40:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-08 03:40:16,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:40:17,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-08 03:40:17,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,088 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-08 03:40:17,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-08 03:40:17,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-08 03:40:17,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {14519#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-08 03:40:17,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {14523#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14519#(< main_~i~0 2048)} is VALID [2022-04-08 03:40:17,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {14523#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14523#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:17,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {14530#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14523#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:17,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {14530#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14530#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:17,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {14537#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14530#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:17,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {14537#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14537#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:17,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {14544#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14537#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:17,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {14544#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14544#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:17,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {14551#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14544#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:17,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {14551#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14551#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:17,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {14558#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14551#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:17,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {14558#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14558#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:17,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {14565#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14558#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:17,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {14565#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14565#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:17,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {14572#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14565#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:17,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {14572#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14572#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:17,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {14579#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14572#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:17,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {14579#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14579#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:17,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {14586#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14579#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:17,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {14586#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14586#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:17,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {14593#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14586#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:17,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {14593#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14593#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:17,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {14600#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14593#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:17,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {14600#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14600#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:17,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {14607#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14600#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:17,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {14607#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14607#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:17,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14607#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:17,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {14614#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14614#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:17,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {14621#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14614#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:17,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {14621#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14621#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:17,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {14628#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14621#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:17,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {14628#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14628#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:17,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {14635#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14628#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:17,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {14635#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14635#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:17,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {14642#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14635#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:17,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {14642#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14642#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:17,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {14649#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14642#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:17,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {14649#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14649#(< main_~i~0 2029)} is VALID [2022-04-08 03:40:17,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14649#(< main_~i~0 2029)} is VALID [2022-04-08 03:40:17,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-08 03:40:17,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-08 03:40:17,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-08 03:40:17,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14087#true} is VALID [2022-04-08 03:40:17,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14087#true} is VALID [2022-04-08 03:40:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-08 03:40:17,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235213524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:40:17,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:40:17,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 03:40:17,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:40:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41736582] [2022-04-08 03:40:17,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41736582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:40:17,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:40:17,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 03:40:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764687668] [2022-04-08 03:40:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:40:17,123 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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 90 [2022-04-08 03:40:17,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:40:17,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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-08 03:40:17,162 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-08 03:40:17,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 03:40:17,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:17,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 03:40:17,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 03:40:17,163 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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-08 03:40:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:17,944 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-08 03:40:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 03:40:17,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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 90 [2022-04-08 03:40:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:40:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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-08 03:40:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-08 03:40:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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-08 03:40:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-08 03:40:17,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 109 transitions. [2022-04-08 03:40:18,042 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-08 03:40:18,043 INFO L225 Difference]: With dead ends: 143 [2022-04-08 03:40:18,043 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 03:40:18,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 161 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-08 03:40:18,045 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 128 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:40:18,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 46 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:40:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 03:40:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-08 03:40:18,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:40:18,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:18,225 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:18,225 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:18,227 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-08 03:40:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-08 03:40:18,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:18,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-08 03:40:18,228 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-08 03:40:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:18,229 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-08 03:40:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-08 03:40:18,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:18,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:18,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:40:18,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:40:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-04-08 03:40:18,231 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2022-04-08 03:40:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:40:18,231 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-04-08 03:40:18,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 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-08 03:40:18,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 96 transitions. [2022-04-08 03:40:18,350 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-08 03:40:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-08 03:40:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 03:40:18,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:40:18,351 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:40:18,383 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-08 03:40:18,567 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-08 03:40:18,567 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:40:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:40:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 39 times [2022-04-08 03:40:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688145872] [2022-04-08 03:40:18,574 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:40:18,574 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:40:18,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:40:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 40 times [2022-04-08 03:40:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:40:18,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812601243] [2022-04-08 03:40:18,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:40:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:40:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:40:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:18,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {15409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15383#true} is VALID [2022-04-08 03:40:18,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-08 03:40:18,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-08 03:40:18,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:40:18,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15383#true} is VALID [2022-04-08 03:40:18,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-08 03:40:18,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-08 03:40:18,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-08 03:40:18,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15388#(= main_~i~0 0)} is VALID [2022-04-08 03:40:18,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {15388#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15388#(= main_~i~0 0)} is VALID [2022-04-08 03:40:18,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {15388#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:18,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {15389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15389#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:18,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {15389#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:18,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {15390#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15390#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:18,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {15390#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:18,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {15391#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15391#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:18,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:18,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {15392#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15392#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:18,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:18,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {15393#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15393#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:18,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {15393#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:18,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {15394#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15394#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:18,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {15394#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:18,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {15395#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15395#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:18,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {15395#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:18,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {15396#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15396#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:18,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {15396#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:18,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {15397#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15397#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:18,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:18,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15398#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:18,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:18,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {15399#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15399#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:18,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {15399#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:18,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {15400#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15400#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:18,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {15400#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:18,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {15401#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15401#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:18,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {15401#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:18,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {15402#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15402#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:18,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {15402#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:18,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {15403#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15403#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:18,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {15403#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:18,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {15404#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15404#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:18,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {15404#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:18,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {15405#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15405#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:18,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {15405#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:18,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {15406#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15406#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:18,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {15406#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:18,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {15407#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15407#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:18,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {15407#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15408#(<= main_~i~0 20)} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {15408#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-08 03:40:18,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-08 03:40:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-08 03:40:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:40:18,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812601243] [2022-04-08 03:40:18,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812601243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:40:18,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151889243] [2022-04-08 03:40:18,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:40:18,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:40:18,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:40:18,916 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-08 03:40:18,917 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-08 03:40:19,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:40:19,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:40:19,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 03:40:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:19,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:40:19,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15383#true} is VALID [2022-04-08 03:40:19,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15383#true} is VALID [2022-04-08 03:40:19,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-08 03:40:19,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-08 03:40:19,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-08 03:40:19,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15428#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:19,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {15428#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15428#(<= main_~i~0 0)} is VALID [2022-04-08 03:40:19,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {15428#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:19,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {15389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15389#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:19,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {15389#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:19,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {15390#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15390#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:19,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {15390#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:19,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {15391#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15391#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:19,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:19,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {15392#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15392#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:19,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:19,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {15393#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15393#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:19,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {15393#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:19,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {15394#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15394#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:19,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {15394#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:19,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {15395#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15395#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:19,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {15395#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:19,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {15396#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15396#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:19,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {15396#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:19,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {15397#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15397#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:19,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:19,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15398#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:19,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:19,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {15399#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15399#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:19,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {15399#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:19,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {15400#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15400#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:19,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {15400#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:19,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {15401#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15401#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:19,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {15401#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:19,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {15402#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15402#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:19,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {15402#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:19,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {15403#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15403#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:19,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {15403#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:19,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {15404#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15404#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:19,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {15404#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:19,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {15405#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15405#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:19,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {15405#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:19,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {15406#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15406#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:19,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {15406#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:19,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {15407#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15407#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:19,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {15407#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15408#(<= main_~i~0 20)} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {15408#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-08 03:40:19,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-08 03:40:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-08 03:40:19,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-08 03:40:20,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-08 03:40:20,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {15834#(< main_~i~0 2048)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-08 03:40:20,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {15838#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15834#(< main_~i~0 2048)} is VALID [2022-04-08 03:40:20,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {15838#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15838#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:20,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {15845#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15838#(< main_~i~0 2047)} is VALID [2022-04-08 03:40:20,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {15845#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15845#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:20,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {15852#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15845#(< main_~i~0 2046)} is VALID [2022-04-08 03:40:20,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {15852#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15852#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:20,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {15859#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15852#(< main_~i~0 2045)} is VALID [2022-04-08 03:40:20,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {15859#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15859#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:20,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {15866#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15859#(< main_~i~0 2044)} is VALID [2022-04-08 03:40:20,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {15866#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15866#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:20,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {15873#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15866#(< main_~i~0 2043)} is VALID [2022-04-08 03:40:20,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {15873#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15873#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:20,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {15880#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15873#(< main_~i~0 2042)} is VALID [2022-04-08 03:40:20,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {15880#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15880#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:20,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {15887#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15880#(< main_~i~0 2041)} is VALID [2022-04-08 03:40:20,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {15887#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15887#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:20,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {15894#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15887#(< main_~i~0 2040)} is VALID [2022-04-08 03:40:20,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {15894#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15894#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:20,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {15901#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15894#(< main_~i~0 2039)} is VALID [2022-04-08 03:40:20,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {15901#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15901#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:20,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {15908#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15901#(< main_~i~0 2038)} is VALID [2022-04-08 03:40:20,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {15908#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15908#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:20,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {15915#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15908#(< main_~i~0 2037)} is VALID [2022-04-08 03:40:20,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {15915#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15915#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:20,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {15922#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15915#(< main_~i~0 2036)} is VALID [2022-04-08 03:40:20,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {15922#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15922#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:20,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {15929#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15922#(< main_~i~0 2035)} is VALID [2022-04-08 03:40:20,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {15929#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15929#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:20,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {15936#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15929#(< main_~i~0 2034)} is VALID [2022-04-08 03:40:20,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {15936#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15936#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:20,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {15943#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15936#(< main_~i~0 2033)} is VALID [2022-04-08 03:40:20,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {15943#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15943#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:20,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {15950#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15943#(< main_~i~0 2032)} is VALID [2022-04-08 03:40:20,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {15950#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15950#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:20,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {15957#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15950#(< main_~i~0 2031)} is VALID [2022-04-08 03:40:20,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {15957#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15957#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:20,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {15964#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15957#(< main_~i~0 2030)} is VALID [2022-04-08 03:40:20,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {15964#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15964#(< main_~i~0 2029)} is VALID [2022-04-08 03:40:20,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {15971#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15964#(< main_~i~0 2029)} is VALID [2022-04-08 03:40:20,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {15971#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15971#(< main_~i~0 2028)} is VALID [2022-04-08 03:40:20,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15971#(< main_~i~0 2028)} is VALID [2022-04-08 03:40:20,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-08 03:40:20,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-08 03:40:20,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-08 03:40:20,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15383#true} is VALID [2022-04-08 03:40:20,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15383#true} is VALID [2022-04-08 03:40:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-08 03:40:20,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151889243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:40:20,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:40:20,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 03:40:20,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:40:20,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688145872] [2022-04-08 03:40:20,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688145872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:40:20,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:40:20,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 03:40:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163155991] [2022-04-08 03:40:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:40:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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 94 [2022-04-08 03:40:20,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:40:20,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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-08 03:40:20,309 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-08 03:40:20,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 03:40:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:20,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 03:40:20,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 03:40:20,310 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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-08 03:40:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:21,117 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2022-04-08 03:40:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 03:40:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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 94 [2022-04-08 03:40:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:40:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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-08 03:40:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-08 03:40:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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-08 03:40:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-08 03:40:21,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 113 transitions. [2022-04-08 03:40:21,204 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-08 03:40:21,206 INFO L225 Difference]: With dead ends: 149 [2022-04-08 03:40:21,206 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 03:40:21,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 03:40:21,207 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:40:21,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 46 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:40:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 03:40:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-08 03:40:21,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:40:21,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:21,398 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:21,398 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:21,400 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-08 03:40:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-08 03:40:21,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:21,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:21,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 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 101 states. [2022-04-08 03:40:21,400 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 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 101 states. [2022-04-08 03:40:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:40:21,402 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-08 03:40:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-08 03:40:21,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:40:21,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:40:21,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:40:21,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:40:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:40:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-08 03:40:21,405 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-08 03:40:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:40:21,405 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-08 03:40:21,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 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-08 03:40:21,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-08 03:40:21,494 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-08 03:40:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-08 03:40:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 03:40:21,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:40:21,494 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:40:21,523 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-08 03:40:21,724 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-08 03:40:21,724 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:40:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:40:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 41 times [2022-04-08 03:40:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:40:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633202457] [2022-04-08 03:40:21,730 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:40:21,731 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:40:21,731 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:40:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 42 times [2022-04-08 03:40:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:40:21,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616989914] [2022-04-08 03:40:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:40:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:40:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:40:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:40:22,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {16762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:40:22,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {16762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-08 03:40:22,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16740#(= main_~i~0 0)} is VALID [2022-04-08 03:40:22,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {16740#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16740#(= main_~i~0 0)} is VALID [2022-04-08 03:40:22,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {16740#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16741#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:22,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {16741#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16741#(<= main_~i~0 1)} is VALID [2022-04-08 03:40:22,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {16741#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16742#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:22,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {16742#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16742#(<= main_~i~0 2)} is VALID [2022-04-08 03:40:22,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {16742#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16743#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:22,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16743#(<= main_~i~0 3)} is VALID [2022-04-08 03:40:22,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {16743#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16744#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:22,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {16744#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16744#(<= main_~i~0 4)} is VALID [2022-04-08 03:40:22,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {16744#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16745#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:22,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {16745#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16745#(<= main_~i~0 5)} is VALID [2022-04-08 03:40:22,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {16745#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16746#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:22,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {16746#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16746#(<= main_~i~0 6)} is VALID [2022-04-08 03:40:22,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {16746#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16747#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:22,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {16747#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16747#(<= main_~i~0 7)} is VALID [2022-04-08 03:40:22,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {16747#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16748#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:22,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16748#(<= main_~i~0 8)} is VALID [2022-04-08 03:40:22,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {16748#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16749#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:22,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16749#(<= main_~i~0 9)} is VALID [2022-04-08 03:40:22,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {16749#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16750#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:22,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {16750#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16750#(<= main_~i~0 10)} is VALID [2022-04-08 03:40:22,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {16750#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16751#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:22,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {16751#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16751#(<= main_~i~0 11)} is VALID [2022-04-08 03:40:22,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {16751#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16752#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:22,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {16752#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16752#(<= main_~i~0 12)} is VALID [2022-04-08 03:40:22,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {16752#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16753#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:22,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {16753#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16753#(<= main_~i~0 13)} is VALID [2022-04-08 03:40:22,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {16753#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16754#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:22,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {16754#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16754#(<= main_~i~0 14)} is VALID [2022-04-08 03:40:22,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {16754#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16755#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:22,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {16755#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16755#(<= main_~i~0 15)} is VALID [2022-04-08 03:40:22,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {16755#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16756#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:22,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {16756#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16756#(<= main_~i~0 16)} is VALID [2022-04-08 03:40:22,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {16756#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16757#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:22,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {16757#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16757#(<= main_~i~0 17)} is VALID [2022-04-08 03:40:22,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {16757#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16758#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:22,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {16758#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16758#(<= main_~i~0 18)} is VALID [2022-04-08 03:40:22,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {16758#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16759#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:22,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {16759#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16759#(<= main_~i~0 19)} is VALID [2022-04-08 03:40:22,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {16759#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16760#(<= main_~i~0 20)} is VALID [2022-04-08 03:40:22,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {16760#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16760#(<= main_~i~0 20)} is VALID [2022-04-08 03:40:22,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {16760#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16761#(<= main_~i~0 21)} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {16761#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {16736#false} ~i~0 := 0; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 62: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,036 INFO L290 TraceCheckUtils]: 63: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 92: Hoare triple {16736#false} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-08 03:40:22,038 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-08 03:40:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-08 03:40:22,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:40:22,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616989914] [2022-04-08 03:40:22,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616989914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:40:22,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33253215] [2022-04-08 03:40:22,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:40:22,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:40:22,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:40:22,040 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-08 03:40:22,041 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-08 03:42:26,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 03:42:26,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:42:27,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 03:42:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:27,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:42:27,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {16735#true} assume !(~i~0 < 2048); {16735#true} is VALID [2022-04-08 03:42:27,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {16735#true} ~i~0 := 0; {16913#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:27,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {16913#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:27,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {16913#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16741#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:27,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {16741#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16741#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:27,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {16741#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16742#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:27,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {16742#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16742#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:27,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {16742#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16743#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:27,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {16743#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16743#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:27,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {16743#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16744#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:27,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {16744#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16744#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:27,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {16744#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16745#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:27,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {16745#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16745#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:27,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {16745#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16746#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:27,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {16746#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16746#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:27,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {16746#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16747#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:27,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {16747#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16747#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:27,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {16747#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16748#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:27,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {16748#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16748#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:27,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {16748#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16749#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:27,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16749#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:27,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {16749#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16750#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:27,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {16750#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16750#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:27,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {16750#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16751#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:27,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {16751#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16751#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:27,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {16751#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16752#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:27,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {16752#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16752#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:27,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {16752#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16753#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:27,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {16753#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16753#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:27,439 INFO L290 TraceCheckUtils]: 77: Hoare triple {16753#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16754#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:27,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {16754#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16754#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:27,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {16754#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16755#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:27,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {16755#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16755#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:27,441 INFO L290 TraceCheckUtils]: 81: Hoare triple {16755#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16756#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:27,441 INFO L290 TraceCheckUtils]: 82: Hoare triple {16756#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16756#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:27,441 INFO L290 TraceCheckUtils]: 83: Hoare triple {16756#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16757#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:27,441 INFO L290 TraceCheckUtils]: 84: Hoare triple {16757#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16757#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:27,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {16757#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16758#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:27,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {16758#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16758#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:27,442 INFO L290 TraceCheckUtils]: 87: Hoare triple {16758#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16759#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:27,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {16759#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16759#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:27,443 INFO L290 TraceCheckUtils]: 89: Hoare triple {16759#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16760#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:27,443 INFO L290 TraceCheckUtils]: 90: Hoare triple {16760#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16760#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:27,443 INFO L290 TraceCheckUtils]: 91: Hoare triple {16760#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16761#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:27,444 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-08 03:42:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-08 03:42:27,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:42:28,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-08 03:42:28,237 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-08 03:42:28,237 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-08 03:42:28,237 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-08 03:42:28,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-08 03:42:28,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {17073#(< main_~i~0 2048)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-08 03:42:28,238 INFO L290 TraceCheckUtils]: 91: Hoare triple {17077#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17073#(< main_~i~0 2048)} is VALID [2022-04-08 03:42:28,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {17077#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17077#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:28,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {17084#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17077#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:28,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {17084#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17084#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:28,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {17091#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17084#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:28,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {17091#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17091#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:28,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {17098#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17091#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:28,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {17098#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17098#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:28,241 INFO L290 TraceCheckUtils]: 83: Hoare triple {17105#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17098#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:28,241 INFO L290 TraceCheckUtils]: 82: Hoare triple {17105#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17105#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:28,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {17112#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17105#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:28,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {17112#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17112#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:28,242 INFO L290 TraceCheckUtils]: 79: Hoare triple {17119#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17112#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:28,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {17119#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17119#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:28,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {17126#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17119#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:28,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {17126#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17126#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:28,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {17133#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17126#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:28,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {17133#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17133#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:28,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {17140#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17133#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:28,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {17140#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17140#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:28,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {17147#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17140#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:28,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {17147#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17147#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:28,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {17154#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17147#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:28,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {17154#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17154#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:28,246 INFO L290 TraceCheckUtils]: 67: Hoare triple {17161#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17154#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:28,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {17161#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17161#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:28,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {17168#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17161#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:28,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {17168#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17168#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:28,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {17175#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17168#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:28,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {17175#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17175#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:28,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {17182#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17175#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:28,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {17182#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17182#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:28,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {17189#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17182#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:28,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {17189#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17189#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:28,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {17196#(< main_~i~0 2030)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17189#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:28,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {17196#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17196#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:28,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {17203#(< main_~i~0 2029)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17196#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:28,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {17203#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17203#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:28,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {17210#(< main_~i~0 2028)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17203#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:28,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {17210#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17210#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {17217#(< main_~i~0 2027)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17210#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {17217#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17217#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {16735#true} ~i~0 := 0; {17217#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {16735#true} assume !(~i~0 < 2048); {16735#true} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16735#true} is VALID [2022-04-08 03:42:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-08 03:42:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33253215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:42:28,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:42:28,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 03:42:28,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:42:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633202457] [2022-04-08 03:42:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633202457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:42:28,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:42:28,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 03:42:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697315942] [2022-04-08 03:42:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:42:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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 98 [2022-04-08 03:42:28,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:42:28,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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-08 03:42:28,311 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-08 03:42:28,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 03:42:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 03:42:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 03:42:28,313 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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-08 03:42:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:29,118 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2022-04-08 03:42:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 03:42:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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 98 [2022-04-08 03:42:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:42:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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-08 03:42:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-08 03:42:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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-08 03:42:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-08 03:42:29,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 117 transitions. [2022-04-08 03:42:29,216 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-08 03:42:29,217 INFO L225 Difference]: With dead ends: 155 [2022-04-08 03:42:29,217 INFO L226 Difference]: Without dead ends: 105 [2022-04-08 03:42:29,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 03:42:29,219 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:42:29,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 41 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:42:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-08 03:42:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2022-04-08 03:42:29,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:42:29,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:29,437 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:29,437 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:29,438 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-08 03:42:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-08 03:42:29,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:29,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:29,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-08 03:42:29,439 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-08 03:42:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:29,440 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-08 03:42:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-08 03:42:29,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:29,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:29,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:42:29,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:42:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-08 03:42:29,442 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2022-04-08 03:42:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:42:29,443 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-08 03:42:29,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 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-08 03:42:29,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-08 03:42:29,543 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-08 03:42:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-08 03:42:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-08 03:42:29,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:42:29,544 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:42:29,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 03:42:29,745 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-08 03:42:29,746 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:42:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:42:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 43 times [2022-04-08 03:42:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:29,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1551304565] [2022-04-08 03:42:29,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:42:29,753 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:42:29,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:42:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 44 times [2022-04-08 03:42:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:42:29,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366195890] [2022-04-08 03:42:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:42:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:42:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:42:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:30,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {18171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:42:30,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {18171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-08 03:42:30,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-08 03:42:30,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18148#(= main_~i~0 0)} is VALID [2022-04-08 03:42:30,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {18148#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18148#(= main_~i~0 0)} is VALID [2022-04-08 03:42:30,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {18148#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:30,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {18149#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18149#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:30,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {18149#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:30,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {18150#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18150#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:30,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {18150#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:30,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {18151#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18151#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:30,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {18151#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:30,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {18152#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18152#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:30,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {18152#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:30,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {18153#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18153#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:30,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {18153#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:30,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {18154#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18154#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:30,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {18154#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:30,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {18155#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18155#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:30,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {18155#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:30,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {18156#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18156#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:30,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {18156#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:30,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {18157#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18157#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:30,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {18157#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:30,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {18158#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18158#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:30,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {18158#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:30,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {18159#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18159#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:30,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {18159#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:30,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {18160#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18160#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:30,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:30,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18161#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:30,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {18161#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:30,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {18162#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18162#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:30,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {18162#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:30,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {18163#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18163#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:30,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {18163#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:30,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {18164#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18164#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:30,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {18164#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:30,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {18165#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18165#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:30,046 INFO L290 TraceCheckUtils]: 41: Hoare triple {18165#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:30,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {18166#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18166#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:30,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {18166#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:30,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {18167#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18167#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:30,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {18167#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:30,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {18168#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18168#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:30,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {18168#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:30,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {18169#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18169#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:30,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {18169#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:30,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {18170#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,049 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,050 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-08 03:42:30,051 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-08 03:42:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 03:42:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:42:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366195890] [2022-04-08 03:42:30,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366195890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:42:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478276030] [2022-04-08 03:42:30,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:42:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:42:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:42:30,053 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-08 03:42:30,054 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-08 03:42:30,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:42:30,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:42:30,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 03:42:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:30,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:42:30,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18143#true} is VALID [2022-04-08 03:42:30,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18143#true} is VALID [2022-04-08 03:42:30,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-08 03:42:30,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-08 03:42:30,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-08 03:42:30,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18190#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:30,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {18190#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18190#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:30,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {18190#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:30,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {18149#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18149#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:30,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {18149#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:30,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {18150#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18150#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:30,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {18150#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:30,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {18151#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18151#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:30,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {18151#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:30,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {18152#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18152#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:30,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {18152#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:30,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {18153#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18153#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:30,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {18153#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:30,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {18154#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18154#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:30,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {18154#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:30,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {18155#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18155#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:30,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {18155#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:30,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {18156#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18156#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:30,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {18156#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:30,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {18157#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18157#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:30,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {18157#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:30,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {18158#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18158#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:30,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {18158#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:30,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {18159#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18159#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:30,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {18159#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:30,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {18160#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18160#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:30,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:30,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18161#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:30,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {18161#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:30,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {18162#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18162#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:30,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {18162#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:30,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {18163#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18163#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:30,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {18163#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:30,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {18164#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18164#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:30,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {18164#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:30,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {18165#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18165#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:30,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {18165#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:30,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {18166#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18166#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:30,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {18166#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:30,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {18167#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18167#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:30,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {18167#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:30,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {18168#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18168#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:30,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {18168#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:30,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {18169#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18169#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:30,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {18169#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:30,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {18170#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-08 03:42:30,736 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-08 03:42:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 03:42:30,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:42:31,614 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,615 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-08 03:42:31,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-08 03:42:31,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {18632#(< main_~i~0 2048)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-08 03:42:31,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {18636#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18632#(< main_~i~0 2048)} is VALID [2022-04-08 03:42:31,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {18636#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18636#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:31,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {18643#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18636#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:31,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {18643#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18643#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:31,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {18650#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18643#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:31,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {18650#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18650#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:31,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {18657#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18650#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:31,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {18657#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18657#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:31,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {18664#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18657#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:31,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {18664#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18664#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:31,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {18671#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18664#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:31,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {18671#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18671#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:31,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {18678#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18671#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:31,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {18678#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18678#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:31,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {18685#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18678#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:31,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {18685#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18685#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:31,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {18692#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18685#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:31,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {18692#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18692#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:31,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {18699#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18692#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:31,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {18699#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18699#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:31,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {18706#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18699#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:31,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {18706#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18706#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:31,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {18713#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18706#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:31,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {18713#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18713#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:31,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {18720#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18713#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:31,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {18720#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18720#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:31,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {18727#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18720#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:31,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {18727#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18727#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:31,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {18734#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18727#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:31,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {18734#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18734#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:31,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {18741#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18734#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:31,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {18741#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18741#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:31,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {18748#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18741#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:31,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {18748#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18748#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:31,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {18755#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18748#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:31,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {18755#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18755#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:31,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {18762#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18755#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:31,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {18762#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18762#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:31,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {18769#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18762#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:31,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {18769#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18769#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:31,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {18776#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18769#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:31,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {18776#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18776#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:31,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {18783#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18776#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:31,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {18783#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18783#(< main_~i~0 2026)} is VALID [2022-04-08 03:42:31,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18783#(< main_~i~0 2026)} is VALID [2022-04-08 03:42:31,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-08 03:42:31,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-08 03:42:31,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-08 03:42:31,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18143#true} is VALID [2022-04-08 03:42:31,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18143#true} is VALID [2022-04-08 03:42:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 03:42:31,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478276030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:42:31,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:42:31,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 03:42:31,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:42:31,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1551304565] [2022-04-08 03:42:31,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1551304565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:42:31,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:42:31,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 03:42:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919020251] [2022-04-08 03:42:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:42:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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 102 [2022-04-08 03:42:31,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:42:31,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-08 03:42:31,677 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-08 03:42:31,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 03:42:31,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:31,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 03:42:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 03:42:31,679 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-08 03:42:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:32,604 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2022-04-08 03:42:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 03:42:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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 102 [2022-04-08 03:42:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:42:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-08 03:42:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-08 03:42:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-08 03:42:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-08 03:42:32,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 121 transitions. [2022-04-08 03:42:32,712 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-08 03:42:32,714 INFO L225 Difference]: With dead ends: 161 [2022-04-08 03:42:32,714 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 03:42:32,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 03:42:32,716 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:42:32,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 41 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:42:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 03:42:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-04-08 03:42:33,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:42:33,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:33,011 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:33,011 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:33,013 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-08 03:42:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-08 03:42:33,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:33,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:33,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-08 03:42:33,014 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-08 03:42:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:33,015 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-08 03:42:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-08 03:42:33,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:33,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:33,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:42:33,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:42:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-08 03:42:33,017 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2022-04-08 03:42:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:42:33,017 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-08 03:42:33,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-08 03:42:33,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-08 03:42:33,172 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-08 03:42:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-08 03:42:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 03:42:33,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:42:33,173 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:42:33,211 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-08 03:42:33,373 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-08 03:42:33,373 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:42:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:42:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 45 times [2022-04-08 03:42:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:33,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573461110] [2022-04-08 03:42:33,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:42:33,381 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:42:33,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:42:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 46 times [2022-04-08 03:42:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:42:33,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556251355] [2022-04-08 03:42:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:42:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:42:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:42:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:33,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {19636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:42:33,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {19636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-08 03:42:33,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-08 03:42:33,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19612#(= main_~i~0 0)} is VALID [2022-04-08 03:42:33,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {19612#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19612#(= main_~i~0 0)} is VALID [2022-04-08 03:42:33,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {19612#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:33,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {19613#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19613#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:33,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {19613#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:33,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {19614#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19614#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:33,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {19614#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:33,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {19615#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19615#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:33,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {19615#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:33,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {19616#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19616#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:33,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {19616#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:33,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {19617#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19617#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:33,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {19617#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:33,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {19618#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19618#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:33,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {19618#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:33,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {19619#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19619#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:33,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {19619#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:33,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {19620#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19620#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:33,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {19620#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:33,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {19621#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19621#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:33,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {19621#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:33,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {19622#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19622#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:33,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {19622#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:33,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {19623#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19623#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:33,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {19623#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:33,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {19624#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19624#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:33,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {19624#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:33,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {19625#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19625#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:33,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {19625#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:33,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {19626#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19626#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:33,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {19626#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:33,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {19627#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19627#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:33,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {19627#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:33,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {19628#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19628#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:33,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {19628#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:33,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {19629#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19629#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:33,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {19629#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:33,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19630#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:33,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:33,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {19631#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19631#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:33,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {19631#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:33,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {19632#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19632#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:33,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {19632#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:33,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {19633#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19633#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:33,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {19633#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:33,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {19634#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19634#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {19634#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19635#(<= main_~i~0 23)} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {19635#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-08 03:42:33,752 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-08 03:42:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-08 03:42:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:42:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556251355] [2022-04-08 03:42:33,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556251355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:42:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211298550] [2022-04-08 03:42:33,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:42:33,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:42:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:42:33,754 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-08 03:42:33,793 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-08 03:42:34,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:42:34,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:42:34,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 03:42:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:34,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:42:34,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19607#true} is VALID [2022-04-08 03:42:34,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19607#true} is VALID [2022-04-08 03:42:34,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-08 03:42:34,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-08 03:42:34,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-08 03:42:34,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19655#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:34,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {19655#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19655#(<= main_~i~0 0)} is VALID [2022-04-08 03:42:34,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19655#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:34,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {19613#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19613#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:34,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {19613#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:34,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {19614#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19614#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:34,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {19614#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:34,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {19615#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19615#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:34,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {19615#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:34,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {19616#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19616#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:34,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {19616#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:34,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {19617#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19617#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:34,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {19617#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:34,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {19618#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19618#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:34,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {19618#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:34,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {19619#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19619#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:34,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {19619#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:34,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {19620#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19620#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:34,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {19620#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:34,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {19621#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19621#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:34,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {19621#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:34,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {19622#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19622#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:34,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {19622#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:34,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {19623#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19623#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:34,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {19623#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:34,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {19624#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19624#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:34,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {19624#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:34,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {19625#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19625#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:34,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {19625#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:34,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {19626#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19626#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:34,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {19626#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:34,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {19627#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19627#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:34,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {19627#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:34,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {19628#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19628#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:34,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {19628#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:34,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {19629#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19629#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:34,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {19629#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:34,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19630#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:34,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:34,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {19631#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19631#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:34,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {19631#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:34,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {19632#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19632#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:34,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {19632#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:34,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {19633#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19633#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:34,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {19633#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:34,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {19634#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19634#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:34,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {19634#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19635#(<= main_~i~0 23)} is VALID [2022-04-08 03:42:34,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {19635#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:34,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,472 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-08 03:42:34,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-08 03:42:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-08 03:42:34,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:42:35,340 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,342 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-08 03:42:35,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-08 03:42:35,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {20115#(< main_~i~0 2048)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-08 03:42:35,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {20119#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20115#(< main_~i~0 2048)} is VALID [2022-04-08 03:42:35,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {20119#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20119#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:35,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {20126#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20119#(< main_~i~0 2047)} is VALID [2022-04-08 03:42:35,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {20126#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20126#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:35,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {20133#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20126#(< main_~i~0 2046)} is VALID [2022-04-08 03:42:35,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {20133#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20133#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:35,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {20140#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20133#(< main_~i~0 2045)} is VALID [2022-04-08 03:42:35,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {20140#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20140#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:35,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {20147#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20140#(< main_~i~0 2044)} is VALID [2022-04-08 03:42:35,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {20147#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20147#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:35,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {20154#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20147#(< main_~i~0 2043)} is VALID [2022-04-08 03:42:35,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {20154#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20154#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:35,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {20161#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20154#(< main_~i~0 2042)} is VALID [2022-04-08 03:42:35,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {20161#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20161#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:35,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {20168#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20161#(< main_~i~0 2041)} is VALID [2022-04-08 03:42:35,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {20168#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20168#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:35,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {20175#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20168#(< main_~i~0 2040)} is VALID [2022-04-08 03:42:35,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {20175#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20175#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:35,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {20182#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20175#(< main_~i~0 2039)} is VALID [2022-04-08 03:42:35,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {20182#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20182#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:35,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {20189#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20182#(< main_~i~0 2038)} is VALID [2022-04-08 03:42:35,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {20189#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20189#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:35,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {20196#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20189#(< main_~i~0 2037)} is VALID [2022-04-08 03:42:35,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20196#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:35,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {20203#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20196#(< main_~i~0 2036)} is VALID [2022-04-08 03:42:35,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {20203#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20203#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:35,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {20210#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20203#(< main_~i~0 2035)} is VALID [2022-04-08 03:42:35,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {20210#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20210#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:35,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {20217#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20210#(< main_~i~0 2034)} is VALID [2022-04-08 03:42:35,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {20217#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20217#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:35,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {20224#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20217#(< main_~i~0 2033)} is VALID [2022-04-08 03:42:35,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {20224#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20224#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:35,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {20231#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20224#(< main_~i~0 2032)} is VALID [2022-04-08 03:42:35,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {20231#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20231#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:35,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {20238#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20231#(< main_~i~0 2031)} is VALID [2022-04-08 03:42:35,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {20238#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20238#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:35,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {20245#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20238#(< main_~i~0 2030)} is VALID [2022-04-08 03:42:35,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {20245#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20245#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:35,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {20252#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20245#(< main_~i~0 2029)} is VALID [2022-04-08 03:42:35,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {20252#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20252#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:35,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {20259#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20252#(< main_~i~0 2028)} is VALID [2022-04-08 03:42:35,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {20259#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20259#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:35,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {20266#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20259#(< main_~i~0 2027)} is VALID [2022-04-08 03:42:35,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {20266#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20266#(< main_~i~0 2026)} is VALID [2022-04-08 03:42:35,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {20273#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20266#(< main_~i~0 2026)} is VALID [2022-04-08 03:42:35,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {20273#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20273#(< main_~i~0 2025)} is VALID [2022-04-08 03:42:35,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {20273#(< main_~i~0 2025)} is VALID [2022-04-08 03:42:35,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-08 03:42:35,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-08 03:42:35,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-08 03:42:35,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19607#true} is VALID [2022-04-08 03:42:35,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19607#true} is VALID [2022-04-08 03:42:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-08 03:42:35,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211298550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:42:35,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:42:35,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 03:42:35,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:42:35,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573461110] [2022-04-08 03:42:35,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573461110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:42:35,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:42:35,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 03:42:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917702423] [2022-04-08 03:42:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:42:35,359 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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 106 [2022-04-08 03:42:35,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:42:35,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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-08 03:42:35,403 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-08 03:42:35,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 03:42:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 03:42:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 03:42:35,405 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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-08 03:42:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:36,358 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2022-04-08 03:42:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 03:42:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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 106 [2022-04-08 03:42:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:42:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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-08 03:42:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-08 03:42:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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-08 03:42:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-08 03:42:36,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 125 transitions. [2022-04-08 03:42:36,455 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-08 03:42:36,459 INFO L225 Difference]: With dead ends: 167 [2022-04-08 03:42:36,459 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 03:42:36,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 03:42:36,461 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 146 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:42:36,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 41 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:42:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 03:42:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-08 03:42:36,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:42:36,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:36,736 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:36,737 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:36,738 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-08 03:42:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-08 03:42:36,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:36,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:36,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 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 113 states. [2022-04-08 03:42:36,739 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 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 113 states. [2022-04-08 03:42:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:42:36,741 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-08 03:42:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-08 03:42:36,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:42:36,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:42:36,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:42:36,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:42:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:42:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-08 03:42:36,743 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-04-08 03:42:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:42:36,743 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-08 03:42:36,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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-08 03:42:36,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-08 03:42:36,876 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-08 03:42:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-08 03:42:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 03:42:36,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:42:36,877 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:42:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 03:42:37,078 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-08 03:42:37,080 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:42:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:42:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 47 times [2022-04-08 03:42:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:42:37,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383593669] [2022-04-08 03:42:37,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:42:37,085 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:42:37,085 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:42:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 48 times [2022-04-08 03:42:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:42:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188371159] [2022-04-08 03:42:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:42:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:42:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:42:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:42:37,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:42:37,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-08 03:42:37,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21132#(= main_~i~0 0)} is VALID [2022-04-08 03:42:37,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {21132#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21132#(= main_~i~0 0)} is VALID [2022-04-08 03:42:37,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {21132#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:37,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {21133#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21133#(<= main_~i~0 1)} is VALID [2022-04-08 03:42:37,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {21133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:37,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {21134#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21134#(<= main_~i~0 2)} is VALID [2022-04-08 03:42:37,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {21134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:37,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21135#(<= main_~i~0 3)} is VALID [2022-04-08 03:42:37,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {21135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:37,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {21136#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21136#(<= main_~i~0 4)} is VALID [2022-04-08 03:42:37,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {21136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:37,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {21137#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21137#(<= main_~i~0 5)} is VALID [2022-04-08 03:42:37,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:37,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21138#(<= main_~i~0 6)} is VALID [2022-04-08 03:42:37,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:37,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21139#(<= main_~i~0 7)} is VALID [2022-04-08 03:42:37,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:37,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21140#(<= main_~i~0 8)} is VALID [2022-04-08 03:42:37,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {21140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:37,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {21141#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21141#(<= main_~i~0 9)} is VALID [2022-04-08 03:42:37,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {21141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:37,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {21142#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21142#(<= main_~i~0 10)} is VALID [2022-04-08 03:42:37,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {21142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:37,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {21143#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21143#(<= main_~i~0 11)} is VALID [2022-04-08 03:42:37,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:37,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {21144#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21144#(<= main_~i~0 12)} is VALID [2022-04-08 03:42:37,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {21144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:37,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {21145#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21145#(<= main_~i~0 13)} is VALID [2022-04-08 03:42:37,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {21145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:37,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {21146#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21146#(<= main_~i~0 14)} is VALID [2022-04-08 03:42:37,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {21146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:37,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {21147#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21147#(<= main_~i~0 15)} is VALID [2022-04-08 03:42:37,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {21147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:37,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {21148#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21148#(<= main_~i~0 16)} is VALID [2022-04-08 03:42:37,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:37,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {21149#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21149#(<= main_~i~0 17)} is VALID [2022-04-08 03:42:37,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:37,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {21150#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21150#(<= main_~i~0 18)} is VALID [2022-04-08 03:42:37,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {21150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:37,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {21151#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21151#(<= main_~i~0 19)} is VALID [2022-04-08 03:42:37,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {21151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:37,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {21152#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21152#(<= main_~i~0 20)} is VALID [2022-04-08 03:42:37,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {21152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:37,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {21153#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21153#(<= main_~i~0 21)} is VALID [2022-04-08 03:42:37,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {21153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:37,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {21154#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21154#(<= main_~i~0 22)} is VALID [2022-04-08 03:42:37,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {21154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 23)} is VALID [2022-04-08 03:42:37,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {21155#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21155#(<= main_~i~0 23)} is VALID [2022-04-08 03:42:37,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {21155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21156#(<= main_~i~0 24)} is VALID [2022-04-08 03:42:37,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {21156#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:42:37,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-08 03:42:37,518 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-08 03:42:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-08 03:42:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:42:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188371159] [2022-04-08 03:42:37,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188371159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:42:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484229715] [2022-04-08 03:42:37,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:42:37,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:42:37,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:42:37,520 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-08 03:42:37,522 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-08 03:45:23,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-08 03:45:23,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:45:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 03:45:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:23,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:45:23,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21127#true} is VALID [2022-04-08 03:45:23,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21127#true} is VALID [2022-04-08 03:45:23,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-08 03:45:23,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-08 03:45:23,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-08 03:45:23,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21176#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:23,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {21176#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21176#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:23,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {21176#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:23,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {21133#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21133#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:23,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {21133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:23,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {21134#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21134#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:23,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {21134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:23,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21135#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:23,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {21135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:23,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {21136#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21136#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:23,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {21136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:23,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {21137#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21137#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:23,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:23,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21138#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:23,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:23,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21139#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:23,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:23,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21140#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:23,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {21140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:23,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {21141#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21141#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:23,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {21141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:23,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {21142#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21142#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:23,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {21142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:23,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {21143#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21143#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:23,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:23,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {21144#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21144#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:23,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {21144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:23,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {21145#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21145#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:23,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {21145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:23,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {21146#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21146#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:23,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {21146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:23,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {21147#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21147#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:23,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {21147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:23,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {21148#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21148#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:23,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:23,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {21149#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21149#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:23,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:23,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {21150#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21150#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:23,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {21150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:23,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {21151#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21151#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:23,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {21151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:23,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {21152#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21152#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:23,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {21152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:23,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {21153#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21153#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:23,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {21153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:23,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {21154#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21154#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:23,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {21154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:23,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {21155#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21155#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {21155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21156#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {21156#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,538 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-08 03:45:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-08 03:45:23,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:45:24,603 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-08 03:45:24,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-08 03:45:24,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {21654#(< main_~i~0 2048)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-08 03:45:24,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {21658#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21654#(< main_~i~0 2048)} is VALID [2022-04-08 03:45:24,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {21658#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21658#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:24,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {21665#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21658#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:24,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {21665#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21665#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:24,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {21672#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21665#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:24,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {21672#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21672#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:24,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {21679#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21672#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:24,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {21679#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21679#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:24,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {21686#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21679#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:24,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {21686#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21686#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:24,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {21693#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21686#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:24,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {21693#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21693#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:24,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {21700#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21693#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:24,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {21700#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21700#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:24,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {21707#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21700#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:24,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {21707#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21707#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:24,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {21714#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21707#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:24,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {21714#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21714#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:24,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {21721#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21714#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:24,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {21721#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21721#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:24,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {21728#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21721#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:24,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {21728#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21728#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:24,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {21735#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21728#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:24,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {21735#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21735#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:24,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21735#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:24,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21742#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:24,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {21749#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21742#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:24,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {21749#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21749#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:24,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {21756#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21749#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:24,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {21756#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21756#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:24,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {21763#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21756#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:24,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {21763#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21763#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:24,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {21770#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21763#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:24,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {21770#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21770#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:24,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {21777#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21770#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:24,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {21777#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21777#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:24,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {21784#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21777#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:24,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {21784#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21784#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:24,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {21791#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21784#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:24,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {21791#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21791#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:24,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {21798#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21791#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:24,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {21798#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21798#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:24,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {21805#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21798#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:24,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {21805#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21805#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:24,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {21812#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21805#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:24,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {21812#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21812#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:24,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {21819#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21812#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:24,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {21819#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21819#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:24,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21819#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:24,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-08 03:45:24,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-08 03:45:24,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-08 03:45:24,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21127#true} is VALID [2022-04-08 03:45:24,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21127#true} is VALID [2022-04-08 03:45:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-08 03:45:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484229715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:45:24,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:45:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 03:45:24,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:45:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383593669] [2022-04-08 03:45:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383593669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:45:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:45:24,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 03:45:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360108669] [2022-04-08 03:45:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:45:24,623 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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 110 [2022-04-08 03:45:24,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:45:24,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-08 03:45:24,685 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-08 03:45:24,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 03:45:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 03:45:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 03:45:24,687 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-08 03:45:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:25,683 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-08 03:45:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 03:45:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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 110 [2022-04-08 03:45:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:45:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-08 03:45:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-08 03:45:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-08 03:45:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-08 03:45:25,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 129 transitions. [2022-04-08 03:45:25,781 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-08 03:45:25,783 INFO L225 Difference]: With dead ends: 173 [2022-04-08 03:45:25,783 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 03:45:25,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 196 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-08 03:45:25,784 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:45:25,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 31 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:45:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 03:45:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-04-08 03:45:26,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:45:26,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:26,095 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:26,095 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:26,096 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-08 03:45:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-08 03:45:26,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:26,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:26,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 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 117 states. [2022-04-08 03:45:26,097 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 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 117 states. [2022-04-08 03:45:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:26,098 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-08 03:45:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-08 03:45:26,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:26,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:26,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:45:26,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:45:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-08 03:45:26,099 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-04-08 03:45:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:45:26,099 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-08 03:45:26,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-08 03:45:26,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-08 03:45:26,206 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-08 03:45:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-08 03:45:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 03:45:26,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:45:26,207 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:45:26,251 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-08 03:45:26,407 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-08 03:45:26,407 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:45:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:45:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 49 times [2022-04-08 03:45:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:26,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776619282] [2022-04-08 03:45:26,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:45:26,413 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:45:26,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:45:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 50 times [2022-04-08 03:45:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:45:26,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807872994] [2022-04-08 03:45:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:45:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:45:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:45:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:26,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {22734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22703#true} is VALID [2022-04-08 03:45:26,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-08 03:45:26,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-08 03:45:26,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:45:26,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {22734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22703#true} is VALID [2022-04-08 03:45:26,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-08 03:45:26,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-08 03:45:26,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-08 03:45:26,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22708#(= main_~i~0 0)} is VALID [2022-04-08 03:45:26,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {22708#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22708#(= main_~i~0 0)} is VALID [2022-04-08 03:45:26,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {22708#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:26,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {22709#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22709#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:26,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {22709#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:26,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {22710#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22710#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:26,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {22710#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:26,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {22711#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22711#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:26,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {22711#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:26,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {22712#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22712#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:26,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {22712#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:26,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {22713#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22713#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:26,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {22713#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:26,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {22714#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22714#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:26,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {22714#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:26,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {22715#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22715#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:26,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {22715#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:26,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {22716#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22716#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:26,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {22716#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:26,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {22717#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22717#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:26,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {22717#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:26,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {22718#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22718#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:26,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {22718#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:26,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {22719#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22719#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:26,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {22719#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:26,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {22720#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22720#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:26,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {22720#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:26,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {22721#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22721#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:26,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {22721#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:26,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {22722#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22722#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:26,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {22722#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:26,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {22723#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22723#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:26,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {22723#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:26,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {22724#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22724#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:26,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {22724#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:26,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {22725#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22725#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:26,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {22725#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:26,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {22726#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22726#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:26,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {22726#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:26,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {22727#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22727#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:26,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {22727#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:26,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {22728#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22728#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:26,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {22728#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:26,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {22729#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22729#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:26,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {22729#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:26,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {22730#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22730#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:26,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {22730#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:26,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {22731#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22731#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:26,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {22731#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:26,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {22732#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22732#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:26,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {22732#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22733#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:26,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {22733#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:26,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-08 03:45:26,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,784 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,785 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-08 03:45:26,786 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-08 03:45:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-08 03:45:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:45:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807872994] [2022-04-08 03:45:26,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807872994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:45:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311298726] [2022-04-08 03:45:26,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:45:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:45:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:45:26,788 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-08 03:45:26,788 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-08 03:45:27,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:45:27,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:45:27,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 03:45:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:27,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:45:27,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22703#true} is VALID [2022-04-08 03:45:27,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22703#true} is VALID [2022-04-08 03:45:27,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-08 03:45:27,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-08 03:45:27,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-08 03:45:27,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22753#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:27,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {22753#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22753#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:27,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {22753#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:27,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {22709#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22709#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:27,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {22709#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:27,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {22710#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22710#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:27,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {22710#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:27,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {22711#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22711#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:27,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {22711#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:27,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {22712#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22712#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:27,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {22712#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:27,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {22713#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22713#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:27,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {22713#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:27,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {22714#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22714#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:27,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {22714#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:27,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {22715#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22715#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:27,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {22715#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:27,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {22716#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22716#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:27,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {22716#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:27,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {22717#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22717#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:27,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {22717#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:27,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {22718#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22718#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:27,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {22718#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:27,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {22719#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22719#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:27,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {22719#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:27,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {22720#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22720#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:27,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {22720#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:27,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {22721#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22721#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:27,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {22721#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:27,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {22722#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22722#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:27,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {22722#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:27,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {22723#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22723#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:27,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {22723#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:27,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {22724#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22724#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:27,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {22724#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:27,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {22725#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22725#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:27,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {22725#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:27,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {22726#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22726#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:27,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {22726#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:27,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {22727#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22727#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:27,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {22727#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:27,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {22728#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22728#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:27,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {22728#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:27,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {22729#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22729#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:27,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {22729#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:27,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {22730#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22730#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:27,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {22730#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:27,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {22731#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22731#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:27,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {22731#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:27,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {22732#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22732#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:27,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {22732#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22733#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:27,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {22733#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,543 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-08 03:45:27,545 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-08 03:45:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-08 03:45:27,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:45:28,585 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-08 03:45:28,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-08 03:45:28,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-08 03:45:28,585 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,586 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,587 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-08 03:45:28,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-08 03:45:28,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {23249#(< main_~i~0 2048)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-08 03:45:28,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {23253#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23249#(< main_~i~0 2048)} is VALID [2022-04-08 03:45:28,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {23253#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23253#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:28,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {23260#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23253#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:28,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {23260#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23260#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:28,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {23267#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23260#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:28,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {23267#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23267#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:28,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {23274#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23267#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:28,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {23274#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23274#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:28,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {23281#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23274#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:28,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {23281#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23281#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:28,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {23288#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23281#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:28,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {23288#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23288#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:28,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {23295#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23288#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:28,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {23295#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23295#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:28,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {23302#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23295#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:28,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {23302#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23302#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:28,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {23309#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23302#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:28,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {23309#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23309#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:28,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {23316#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23309#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:28,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {23316#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23316#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:28,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {23323#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23316#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:28,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {23323#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23323#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:28,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {23330#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23323#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:28,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {23330#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23330#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:28,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {23337#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23330#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:28,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {23337#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23337#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:28,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {23344#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23337#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:28,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {23344#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23344#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:28,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {23351#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23344#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:28,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23351#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:28,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {23358#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23351#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:28,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {23358#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23358#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:28,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {23365#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23358#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:28,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {23365#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23365#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:28,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {23372#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23365#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:28,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {23372#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23372#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:28,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {23379#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23372#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:28,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {23379#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23379#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:28,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {23386#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23379#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:28,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {23386#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23386#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:28,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {23393#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23386#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:28,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {23393#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23393#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:28,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {23400#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23393#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:28,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {23400#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23400#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:28,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {23407#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23400#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:28,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {23407#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23407#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:28,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {23414#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23407#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:28,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {23414#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23414#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:28,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {23421#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23414#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:28,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {23421#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23421#(< main_~i~0 2023)} is VALID [2022-04-08 03:45:28,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {23421#(< main_~i~0 2023)} is VALID [2022-04-08 03:45:28,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-08 03:45:28,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-08 03:45:28,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-08 03:45:28,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22703#true} is VALID [2022-04-08 03:45:28,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22703#true} is VALID [2022-04-08 03:45:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-08 03:45:28,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311298726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:45:28,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:45:28,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-08 03:45:28,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:45:28,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776619282] [2022-04-08 03:45:28,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776619282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:45:28,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:45:28,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 03:45:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444338533] [2022-04-08 03:45:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:45:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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 114 [2022-04-08 03:45:28,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:45:28,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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-08 03:45:28,652 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-08 03:45:28,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 03:45:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 03:45:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 03:45:28,653 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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-08 03:45:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:29,690 INFO L93 Difference]: Finished difference Result 179 states and 182 transitions. [2022-04-08 03:45:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 03:45:29,690 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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 114 [2022-04-08 03:45:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:45:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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-08 03:45:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-08 03:45:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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-08 03:45:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-08 03:45:29,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 133 transitions. [2022-04-08 03:45:29,784 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-08 03:45:29,785 INFO L225 Difference]: With dead ends: 179 [2022-04-08 03:45:29,785 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 03:45:29,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 03:45:29,786 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 164 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:45:29,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 36 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:45:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 03:45:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-04-08 03:45:30,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:45:30,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:30,111 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:30,111 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:30,112 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-08 03:45:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-08 03:45:30,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:30,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:30,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 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 121 states. [2022-04-08 03:45:30,113 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 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 121 states. [2022-04-08 03:45:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:30,114 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-08 03:45:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-08 03:45:30,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:30,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:30,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:45:30,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:45:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-08 03:45:30,116 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-08 03:45:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:45:30,116 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-08 03:45:30,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 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-08 03:45:30,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-08 03:45:30,261 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-08 03:45:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-08 03:45:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 03:45:30,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:45:30,261 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:45:30,283 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-08 03:45:30,483 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-08 03:45:30,484 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:45:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:45:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 51 times [2022-04-08 03:45:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:30,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499239179] [2022-04-08 03:45:30,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:45:30,489 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:45:30,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:45:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 52 times [2022-04-08 03:45:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:45:30,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707212700] [2022-04-08 03:45:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:45:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:45:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:45:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:30,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {24367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24335#true} is VALID [2022-04-08 03:45:30,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-08 03:45:30,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-08 03:45:30,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:45:30,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {24367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24335#true} is VALID [2022-04-08 03:45:30,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-08 03:45:30,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-08 03:45:30,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-08 03:45:30,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24340#(= main_~i~0 0)} is VALID [2022-04-08 03:45:30,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {24340#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24340#(= main_~i~0 0)} is VALID [2022-04-08 03:45:30,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {24340#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:30,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {24341#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24341#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:30,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {24341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:30,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {24342#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24342#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:30,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {24342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:30,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {24343#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24343#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:30,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {24343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:30,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {24344#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24344#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:30,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {24344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:30,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {24345#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24345#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:30,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {24345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:30,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {24346#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24346#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:30,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {24346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:30,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {24347#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24347#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:30,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {24347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:30,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {24348#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24348#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:30,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {24348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:30,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {24349#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24349#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:30,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {24349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:30,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {24350#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24350#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:30,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {24350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:30,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {24351#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24351#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:30,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {24351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:30,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {24352#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24352#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:30,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {24352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:30,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {24353#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24353#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:30,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {24353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:30,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {24354#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24354#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:30,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {24354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:30,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {24355#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24355#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:30,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {24355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:30,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {24356#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24356#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:30,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {24356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:30,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {24357#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24357#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:30,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {24357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:30,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {24358#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24358#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:30,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {24358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:30,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {24359#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24359#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:30,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {24359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:30,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {24360#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24360#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:30,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {24360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:30,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {24361#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24361#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:30,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {24361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:30,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {24362#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24362#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:30,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {24362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:30,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {24363#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24363#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:30,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {24363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:30,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {24364#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24364#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:30,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {24364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:30,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {24365#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24365#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:30,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {24365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24366#(<= main_~i~0 26)} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {24366#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,869 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,870 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-08 03:45:30,871 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-08 03:45:30,872 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-08 03:45:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-08 03:45:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:45:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707212700] [2022-04-08 03:45:30,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707212700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:45:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992669543] [2022-04-08 03:45:30,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:45:30,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:45:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:45:30,873 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-08 03:45:30,874 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-08 03:45:31,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:45:31,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:45:31,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 03:45:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:31,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:45:31,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-08 03:45:31,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24335#true} is VALID [2022-04-08 03:45:31,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-08 03:45:31,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-08 03:45:31,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-08 03:45:31,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24386#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:31,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {24386#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24386#(<= main_~i~0 0)} is VALID [2022-04-08 03:45:31,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {24386#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:31,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {24341#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24341#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:31,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {24341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:31,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {24342#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24342#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:31,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {24342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:31,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {24343#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24343#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:31,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {24343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:31,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {24344#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24344#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:31,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {24344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:31,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {24345#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24345#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:31,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {24345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:31,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {24346#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24346#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:31,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {24346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:31,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {24347#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24347#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:31,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {24347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:31,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {24348#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24348#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:31,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {24348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:31,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {24349#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24349#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:31,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {24349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:31,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {24350#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24350#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:31,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {24350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:31,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {24351#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24351#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:31,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {24351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:31,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {24352#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24352#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:31,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {24352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:31,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {24353#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24353#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:31,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {24353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:31,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {24354#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24354#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:31,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {24354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:31,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {24355#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24355#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:31,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {24355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:31,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {24356#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24356#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:31,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {24356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:31,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {24357#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24357#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:31,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {24357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:31,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {24358#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24358#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:31,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {24358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:31,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {24359#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24359#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:31,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {24359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:31,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {24360#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24360#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:31,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {24360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:31,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {24361#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24361#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:31,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {24361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:31,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {24362#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24362#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:31,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {24362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:31,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {24363#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24363#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:31,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {24363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:31,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {24364#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24364#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:31,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {24364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:31,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {24365#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24365#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:31,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {24365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24366#(<= main_~i~0 26)} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {24366#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,732 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:31,733 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-08 03:45:31,734 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-08 03:45:31,734 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-08 03:45:31,734 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-08 03:45:31,734 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-08 03:45:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-08 03:45:31,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:45:32,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-08 03:45:32,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-08 03:45:32,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-08 03:45:32,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {24900#(< main_~i~0 2048)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-08 03:45:32,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {24904#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24900#(< main_~i~0 2048)} is VALID [2022-04-08 03:45:32,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {24904#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24904#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:32,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {24911#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24904#(< main_~i~0 2047)} is VALID [2022-04-08 03:45:32,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {24911#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24911#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:32,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {24918#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24911#(< main_~i~0 2046)} is VALID [2022-04-08 03:45:32,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {24918#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24918#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:32,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {24925#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24918#(< main_~i~0 2045)} is VALID [2022-04-08 03:45:32,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {24925#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24925#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:32,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {24932#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24925#(< main_~i~0 2044)} is VALID [2022-04-08 03:45:32,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {24932#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24932#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:32,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {24939#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24932#(< main_~i~0 2043)} is VALID [2022-04-08 03:45:32,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {24939#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24939#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:32,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {24946#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24939#(< main_~i~0 2042)} is VALID [2022-04-08 03:45:32,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {24946#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24946#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:32,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {24953#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24946#(< main_~i~0 2041)} is VALID [2022-04-08 03:45:32,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {24953#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24953#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:32,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {24960#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24953#(< main_~i~0 2040)} is VALID [2022-04-08 03:45:32,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {24960#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24960#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:32,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {24967#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24960#(< main_~i~0 2039)} is VALID [2022-04-08 03:45:32,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {24967#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24967#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:32,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {24974#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24967#(< main_~i~0 2038)} is VALID [2022-04-08 03:45:32,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {24974#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24974#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:32,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {24981#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24974#(< main_~i~0 2037)} is VALID [2022-04-08 03:45:32,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {24981#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24981#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:32,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {24988#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24981#(< main_~i~0 2036)} is VALID [2022-04-08 03:45:32,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {24988#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24988#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:32,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {24995#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24988#(< main_~i~0 2035)} is VALID [2022-04-08 03:45:32,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {24995#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24995#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:32,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {25002#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24995#(< main_~i~0 2034)} is VALID [2022-04-08 03:45:32,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {25002#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25002#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:32,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {25009#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25002#(< main_~i~0 2033)} is VALID [2022-04-08 03:45:32,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {25009#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25009#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:32,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {25016#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25009#(< main_~i~0 2032)} is VALID [2022-04-08 03:45:32,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {25016#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25016#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:32,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {25023#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25016#(< main_~i~0 2031)} is VALID [2022-04-08 03:45:32,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {25023#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25023#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:32,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {25030#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25023#(< main_~i~0 2030)} is VALID [2022-04-08 03:45:32,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {25030#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25030#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:32,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {25037#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25030#(< main_~i~0 2029)} is VALID [2022-04-08 03:45:32,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {25037#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25037#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:32,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {25044#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25037#(< main_~i~0 2028)} is VALID [2022-04-08 03:45:32,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {25044#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25044#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:32,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {25051#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25044#(< main_~i~0 2027)} is VALID [2022-04-08 03:45:32,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {25051#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25051#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:32,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {25058#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25051#(< main_~i~0 2026)} is VALID [2022-04-08 03:45:32,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {25058#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25058#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:32,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {25065#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25058#(< main_~i~0 2025)} is VALID [2022-04-08 03:45:32,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {25065#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25065#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:32,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {25072#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25065#(< main_~i~0 2024)} is VALID [2022-04-08 03:45:32,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {25072#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25072#(< main_~i~0 2023)} is VALID [2022-04-08 03:45:32,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {25079#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25072#(< main_~i~0 2023)} is VALID [2022-04-08 03:45:32,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {25079#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25079#(< main_~i~0 2022)} is VALID [2022-04-08 03:45:32,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25079#(< main_~i~0 2022)} is VALID [2022-04-08 03:45:32,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-08 03:45:32,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-08 03:45:32,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-08 03:45:32,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24335#true} is VALID [2022-04-08 03:45:32,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-08 03:45:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-08 03:45:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992669543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:45:32,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:45:32,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-08 03:45:32,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:45:32,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499239179] [2022-04-08 03:45:32,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499239179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:45:32,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:45:32,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 03:45:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078328243] [2022-04-08 03:45:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:45:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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 118 [2022-04-08 03:45:32,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:45:32,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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-08 03:45:32,956 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-08 03:45:32,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 03:45:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 03:45:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 03:45:32,958 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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-08 03:45:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:34,075 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2022-04-08 03:45:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 03:45:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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 118 [2022-04-08 03:45:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:45:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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-08 03:45:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-08 03:45:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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-08 03:45:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-08 03:45:34,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 137 transitions. [2022-04-08 03:45:34,199 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-08 03:45:34,200 INFO L225 Difference]: With dead ends: 185 [2022-04-08 03:45:34,201 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 03:45:34,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-08 03:45:34,202 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 180 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:45:34,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 36 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:45:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 03:45:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-08 03:45:34,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:45:34,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:34,509 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:34,509 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:34,511 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-08 03:45:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-08 03:45:34,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:34,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:34,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 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 125 states. [2022-04-08 03:45:34,511 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 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 125 states. [2022-04-08 03:45:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:45:34,512 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-08 03:45:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-08 03:45:34,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:45:34,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:45:34,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:45:34,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:45:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:45:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-04-08 03:45:34,514 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2022-04-08 03:45:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:45:34,514 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-04-08 03:45:34,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 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-08 03:45:34,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 124 transitions. [2022-04-08 03:45:34,653 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-08 03:45:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2022-04-08 03:45:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 03:45:34,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:45:34,653 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:45:34,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 03:45:34,854 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-08 03:45:34,854 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:45:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:45:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 53 times [2022-04-08 03:45:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:45:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204891465] [2022-04-08 03:45:34,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:45:34,859 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:45:34,859 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:45:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 54 times [2022-04-08 03:45:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:45:34,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918415467] [2022-04-08 03:45:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:45:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:45:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:45:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:45:35,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {26056#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26023#true} is VALID [2022-04-08 03:45:35,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-08 03:45:35,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-08 03:45:35,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26056#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:45:35,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26023#true} is VALID [2022-04-08 03:45:35,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-08 03:45:35,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-08 03:45:35,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-08 03:45:35,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26028#(= main_~i~0 0)} is VALID [2022-04-08 03:45:35,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {26028#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26028#(= main_~i~0 0)} is VALID [2022-04-08 03:45:35,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {26028#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:35,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {26029#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26029#(<= main_~i~0 1)} is VALID [2022-04-08 03:45:35,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {26029#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:35,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {26030#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26030#(<= main_~i~0 2)} is VALID [2022-04-08 03:45:35,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {26030#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:35,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26031#(<= main_~i~0 3)} is VALID [2022-04-08 03:45:35,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:35,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {26032#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26032#(<= main_~i~0 4)} is VALID [2022-04-08 03:45:35,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {26032#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:35,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {26033#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26033#(<= main_~i~0 5)} is VALID [2022-04-08 03:45:35,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {26033#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:35,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {26034#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26034#(<= main_~i~0 6)} is VALID [2022-04-08 03:45:35,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {26034#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:35,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {26035#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26035#(<= main_~i~0 7)} is VALID [2022-04-08 03:45:35,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {26035#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:35,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {26036#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26036#(<= main_~i~0 8)} is VALID [2022-04-08 03:45:35,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {26036#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:35,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {26037#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26037#(<= main_~i~0 9)} is VALID [2022-04-08 03:45:35,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {26037#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:35,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {26038#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26038#(<= main_~i~0 10)} is VALID [2022-04-08 03:45:35,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {26038#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:35,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {26039#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26039#(<= main_~i~0 11)} is VALID [2022-04-08 03:45:35,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {26039#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:35,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {26040#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26040#(<= main_~i~0 12)} is VALID [2022-04-08 03:45:35,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {26040#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:35,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {26041#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26041#(<= main_~i~0 13)} is VALID [2022-04-08 03:45:35,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {26041#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:35,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {26042#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26042#(<= main_~i~0 14)} is VALID [2022-04-08 03:45:35,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {26042#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:35,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {26043#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26043#(<= main_~i~0 15)} is VALID [2022-04-08 03:45:35,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {26043#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:35,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {26044#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26044#(<= main_~i~0 16)} is VALID [2022-04-08 03:45:35,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {26044#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:35,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {26045#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26045#(<= main_~i~0 17)} is VALID [2022-04-08 03:45:35,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {26045#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:35,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {26046#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26046#(<= main_~i~0 18)} is VALID [2022-04-08 03:45:35,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {26046#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:35,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {26047#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26047#(<= main_~i~0 19)} is VALID [2022-04-08 03:45:35,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {26047#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:35,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26048#(<= main_~i~0 20)} is VALID [2022-04-08 03:45:35,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {26048#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:35,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {26049#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26049#(<= main_~i~0 21)} is VALID [2022-04-08 03:45:35,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {26049#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:35,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {26050#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26050#(<= main_~i~0 22)} is VALID [2022-04-08 03:45:35,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {26050#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:35,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {26051#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26051#(<= main_~i~0 23)} is VALID [2022-04-08 03:45:35,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {26051#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:35,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {26052#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26052#(<= main_~i~0 24)} is VALID [2022-04-08 03:45:35,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {26052#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:35,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {26053#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26053#(<= main_~i~0 25)} is VALID [2022-04-08 03:45:35,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {26053#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 26)} is VALID [2022-04-08 03:45:35,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {26054#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26054#(<= main_~i~0 26)} is VALID [2022-04-08 03:45:35,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {26054#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26055#(<= main_~i~0 27)} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {26055#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,288 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,289 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-08 03:45:35,290 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-08 03:45:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-08 03:45:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:45:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918415467] [2022-04-08 03:45:35,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918415467] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:45:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477821930] [2022-04-08 03:45:35,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:45:35,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:45:35,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:45:35,292 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-08 03:45:35,294 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-08 03:51:59,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-08 03:51:59,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:51:59,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 03:51:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:59,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:51:59,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26023#true} is VALID [2022-04-08 03:51:59,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26023#true} is VALID [2022-04-08 03:51:59,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-08 03:51:59,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-08 03:51:59,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-08 03:51:59,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26075#(<= main_~i~0 0)} is VALID [2022-04-08 03:51:59,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {26075#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26075#(<= main_~i~0 0)} is VALID [2022-04-08 03:51:59,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {26075#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 1)} is VALID [2022-04-08 03:51:59,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {26029#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26029#(<= main_~i~0 1)} is VALID [2022-04-08 03:51:59,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {26029#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 2)} is VALID [2022-04-08 03:51:59,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {26030#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26030#(<= main_~i~0 2)} is VALID [2022-04-08 03:51:59,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {26030#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 3)} is VALID [2022-04-08 03:51:59,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26031#(<= main_~i~0 3)} is VALID [2022-04-08 03:51:59,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 4)} is VALID [2022-04-08 03:51:59,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {26032#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26032#(<= main_~i~0 4)} is VALID [2022-04-08 03:51:59,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {26032#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 5)} is VALID [2022-04-08 03:51:59,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {26033#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26033#(<= main_~i~0 5)} is VALID [2022-04-08 03:51:59,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {26033#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 6)} is VALID [2022-04-08 03:51:59,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {26034#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26034#(<= main_~i~0 6)} is VALID [2022-04-08 03:51:59,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {26034#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 7)} is VALID [2022-04-08 03:51:59,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {26035#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26035#(<= main_~i~0 7)} is VALID [2022-04-08 03:51:59,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {26035#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 8)} is VALID [2022-04-08 03:51:59,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {26036#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26036#(<= main_~i~0 8)} is VALID [2022-04-08 03:51:59,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {26036#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 9)} is VALID [2022-04-08 03:51:59,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {26037#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26037#(<= main_~i~0 9)} is VALID [2022-04-08 03:51:59,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {26037#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 10)} is VALID [2022-04-08 03:51:59,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {26038#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26038#(<= main_~i~0 10)} is VALID [2022-04-08 03:51:59,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {26038#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 11)} is VALID [2022-04-08 03:51:59,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {26039#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26039#(<= main_~i~0 11)} is VALID [2022-04-08 03:51:59,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {26039#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 12)} is VALID [2022-04-08 03:51:59,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {26040#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26040#(<= main_~i~0 12)} is VALID [2022-04-08 03:51:59,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {26040#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 13)} is VALID [2022-04-08 03:51:59,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {26041#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26041#(<= main_~i~0 13)} is VALID [2022-04-08 03:51:59,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {26041#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 14)} is VALID [2022-04-08 03:51:59,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {26042#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26042#(<= main_~i~0 14)} is VALID [2022-04-08 03:51:59,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {26042#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 15)} is VALID [2022-04-08 03:51:59,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {26043#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26043#(<= main_~i~0 15)} is VALID [2022-04-08 03:51:59,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {26043#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 16)} is VALID [2022-04-08 03:51:59,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {26044#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26044#(<= main_~i~0 16)} is VALID [2022-04-08 03:51:59,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {26044#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 17)} is VALID [2022-04-08 03:51:59,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {26045#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26045#(<= main_~i~0 17)} is VALID [2022-04-08 03:51:59,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {26045#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 18)} is VALID [2022-04-08 03:51:59,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {26046#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26046#(<= main_~i~0 18)} is VALID [2022-04-08 03:51:59,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {26046#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 19)} is VALID [2022-04-08 03:51:59,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {26047#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26047#(<= main_~i~0 19)} is VALID [2022-04-08 03:51:59,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {26047#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 20)} is VALID [2022-04-08 03:51:59,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26048#(<= main_~i~0 20)} is VALID [2022-04-08 03:51:59,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {26048#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 21)} is VALID [2022-04-08 03:51:59,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {26049#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26049#(<= main_~i~0 21)} is VALID [2022-04-08 03:51:59,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {26049#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 22)} is VALID [2022-04-08 03:51:59,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {26050#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26050#(<= main_~i~0 22)} is VALID [2022-04-08 03:51:59,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {26050#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 23)} is VALID [2022-04-08 03:51:59,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {26051#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26051#(<= main_~i~0 23)} is VALID [2022-04-08 03:51:59,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {26051#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 24)} is VALID [2022-04-08 03:51:59,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {26052#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26052#(<= main_~i~0 24)} is VALID [2022-04-08 03:51:59,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {26052#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 25)} is VALID [2022-04-08 03:51:59,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {26053#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26053#(<= main_~i~0 25)} is VALID [2022-04-08 03:51:59,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {26053#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 26)} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {26054#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26054#(<= main_~i~0 26)} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {26054#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26055#(<= main_~i~0 27)} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {26055#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,669 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,670 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-08 03:51:59,671 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-08 03:51:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-08 03:51:59,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:52:00,821 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,822 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,824 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-08 03:52:00,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-08 03:52:00,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-08 03:52:00,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {26607#(< main_~i~0 2048)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-08 03:52:00,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {26611#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26607#(< main_~i~0 2048)} is VALID [2022-04-08 03:52:00,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {26611#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26611#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:00,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {26618#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26611#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:00,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {26618#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26618#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:00,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {26625#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26618#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:00,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {26625#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26625#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:00,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {26632#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26625#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:00,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {26632#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26632#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:00,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {26639#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26632#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:00,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {26639#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26639#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:00,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {26646#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26639#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:00,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {26646#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26646#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:00,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {26653#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26646#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:00,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {26653#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26653#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:00,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {26660#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26653#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:00,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {26660#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26660#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:00,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {26667#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26660#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:00,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {26667#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26667#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:00,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {26674#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26667#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:00,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {26674#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26674#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:00,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {26681#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26674#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:00,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {26681#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26681#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:00,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {26688#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26681#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:00,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {26688#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26688#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:00,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {26695#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26688#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:00,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {26695#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26695#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:00,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {26702#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26695#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:00,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {26702#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26702#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:00,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {26709#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26702#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:00,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {26709#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26709#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:00,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {26716#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26709#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:00,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {26716#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26716#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:00,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {26723#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26716#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:00,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {26723#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26723#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:00,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {26730#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26723#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:00,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {26730#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26730#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:00,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {26737#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26730#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:00,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {26737#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26737#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:00,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {26744#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26737#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:00,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {26744#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26744#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:00,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {26751#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26744#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:00,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {26751#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26751#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:00,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {26758#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26751#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:00,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {26758#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26758#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:00,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {26765#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26758#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:00,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {26765#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26765#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:00,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {26772#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26765#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:00,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {26772#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26772#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:00,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {26779#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26772#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:00,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {26779#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26779#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:00,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {26786#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26779#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:00,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {26786#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26786#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:00,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {26793#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26786#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:00,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {26793#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26793#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:00,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26793#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:00,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-08 03:52:00,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-08 03:52:00,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-08 03:52:00,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26023#true} is VALID [2022-04-08 03:52:00,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26023#true} is VALID [2022-04-08 03:52:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-08 03:52:00,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477821930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:52:00,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:52:00,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-08 03:52:00,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:52:00,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204891465] [2022-04-08 03:52:00,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204891465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:52:00,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:52:00,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 03:52:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443212815] [2022-04-08 03:52:00,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:52:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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 122 [2022-04-08 03:52:00,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:52:00,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-08 03:52:00,896 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-08 03:52:00,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 03:52:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 03:52:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 03:52:00,897 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-08 03:52:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:01,943 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-08 03:52:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 03:52:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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 122 [2022-04-08 03:52:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:52:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-08 03:52:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-08 03:52:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-08 03:52:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-08 03:52:01,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 141 transitions. [2022-04-08 03:52:02,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:52:02,060 INFO L225 Difference]: With dead ends: 191 [2022-04-08 03:52:02,060 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 03:52:02,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 03:52:02,062 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 180 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:52:02,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 26 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:52:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 03:52:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-04-08 03:52:02,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:52:02,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:02,389 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:02,389 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:02,390 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-08 03:52:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-08 03:52:02,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:02,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:02,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 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 129 states. [2022-04-08 03:52:02,391 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 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 129 states. [2022-04-08 03:52:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:02,392 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-08 03:52:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-08 03:52:02,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:02,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:02,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:52:02,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:52:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-08 03:52:02,394 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2022-04-08 03:52:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:52:02,394 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-08 03:52:02,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-08 03:52:02,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-08 03:52:02,536 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-08 03:52:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-08 03:52:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-08 03:52:02,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:52:02,537 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:52:02,611 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-08 03:52:02,737 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-08 03:52:02,738 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:52:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:52:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 55 times [2022-04-08 03:52:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:02,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197631845] [2022-04-08 03:52:02,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:52:02,744 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:52:02,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:52:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 56 times [2022-04-08 03:52:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:52:02,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629383672] [2022-04-08 03:52:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:52:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:52:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:52:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:03,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {27801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27767#true} is VALID [2022-04-08 03:52:03,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-08 03:52:03,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-08 03:52:03,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:52:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {27801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27767#true} is VALID [2022-04-08 03:52:03,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-08 03:52:03,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-08 03:52:03,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-08 03:52:03,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27772#(= main_~i~0 0)} is VALID [2022-04-08 03:52:03,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {27772#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27772#(= main_~i~0 0)} is VALID [2022-04-08 03:52:03,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {27772#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:03,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {27773#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27773#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:03,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {27773#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:03,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {27774#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27774#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {27774#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:03,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {27775#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27775#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:03,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {27775#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:03,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {27776#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27776#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:03,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {27776#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:03,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {27777#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27777#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:03,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {27777#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:03,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {27778#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27778#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:03,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {27778#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:03,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {27779#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27779#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:03,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {27779#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:03,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27780#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:03,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:03,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27781#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:03,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:03,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {27782#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27782#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:03,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {27782#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:03,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {27783#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27783#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:03,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {27783#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:03,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {27784#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27784#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:03,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {27784#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:03,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {27785#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27785#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:03,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {27785#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:03,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {27786#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27786#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:03,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {27786#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:03,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {27787#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27787#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:03,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {27787#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:03,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {27788#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27788#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:03,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {27788#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:03,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {27789#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27789#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:03,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {27789#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:03,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {27790#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27790#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:03,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {27790#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:03,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {27791#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27791#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:03,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {27791#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:03,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {27792#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27792#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:03,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {27792#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:03,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {27793#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27793#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:03,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {27793#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:03,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {27794#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27794#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:03,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {27794#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:03,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {27795#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27795#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:03,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {27795#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:03,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {27796#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27796#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:03,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {27796#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:03,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {27797#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27797#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:03,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {27797#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:03,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {27798#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27798#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:03,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {27798#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:03,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {27799#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27799#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {27799#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27800#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {27800#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,260 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-08 03:52:03,261 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-08 03:52:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-08 03:52:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:52:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629383672] [2022-04-08 03:52:03,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629383672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:52:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432769905] [2022-04-08 03:52:03,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:52:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:52:03,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:52:03,263 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-08 03:52:03,264 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-08 03:52:03,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:52:03,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:52:03,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 03:52:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:03,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:52:04,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27767#true} is VALID [2022-04-08 03:52:04,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27767#true} is VALID [2022-04-08 03:52:04,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-08 03:52:04,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-08 03:52:04,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-08 03:52:04,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27820#(<= main_~i~0 0)} is VALID [2022-04-08 03:52:04,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {27820#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27820#(<= main_~i~0 0)} is VALID [2022-04-08 03:52:04,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {27820#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:04,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {27773#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27773#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:04,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {27773#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:04,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {27774#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27774#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:04,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {27774#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:04,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {27775#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27775#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:04,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {27775#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:04,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {27776#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27776#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:04,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {27776#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:04,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {27777#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27777#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:04,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {27777#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:04,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {27778#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27778#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:04,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {27778#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:04,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {27779#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27779#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:04,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {27779#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:04,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27780#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:04,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:04,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27781#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:04,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:04,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {27782#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27782#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:04,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {27782#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:04,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {27783#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27783#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:04,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {27783#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:04,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {27784#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27784#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:04,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {27784#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:04,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {27785#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27785#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:04,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {27785#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:04,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {27786#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27786#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:04,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {27786#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:04,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {27787#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27787#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:04,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {27787#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:04,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {27788#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27788#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:04,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {27788#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:04,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {27789#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27789#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:04,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {27789#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:04,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {27790#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27790#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:04,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {27790#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:04,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {27791#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27791#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:04,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {27791#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:04,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {27792#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27792#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:04,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {27792#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:04,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {27793#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27793#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:04,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {27793#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:04,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {27794#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27794#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:04,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {27794#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:04,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {27795#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27795#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:04,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {27795#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:04,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {27796#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27796#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:04,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {27796#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:04,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {27797#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27797#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:04,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {27797#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:04,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {27798#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27798#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:04,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {27798#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:04,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {27799#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27799#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:04,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {27799#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27800#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {27800#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-08 03:52:04,243 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-08 03:52:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-08 03:52:04,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:52:05,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-08 03:52:05,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-08 03:52:05,512 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-08 03:52:05,512 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-08 03:52:05,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-08 03:52:05,512 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,513 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-08 03:52:05,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-08 03:52:05,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-08 03:52:05,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {28370#(< main_~i~0 2048)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-08 03:52:05,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {28374#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28370#(< main_~i~0 2048)} is VALID [2022-04-08 03:52:05,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {28374#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28374#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:05,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {28381#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28374#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:05,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {28381#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28381#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:05,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {28388#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28381#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:05,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {28388#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28388#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:05,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {28395#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28388#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:05,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {28395#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28395#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:05,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {28402#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28395#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:05,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {28402#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28402#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:05,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {28409#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28402#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:05,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {28409#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28409#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:05,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {28416#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28409#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:05,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {28416#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28416#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:05,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {28423#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28416#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:05,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {28423#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28423#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:05,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {28430#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28423#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:05,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {28430#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28430#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:05,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {28437#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28430#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:05,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {28437#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28437#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:05,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {28444#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28437#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:05,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {28444#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28444#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:05,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {28451#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28444#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:05,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {28451#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28451#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:05,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {28458#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28451#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:05,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {28458#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28458#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:05,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {28465#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28458#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:05,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {28465#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28465#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:05,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {28472#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28465#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:05,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {28472#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28472#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:05,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {28479#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28472#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:05,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {28479#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28479#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:05,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {28486#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28479#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:05,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {28486#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28486#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:05,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {28493#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28486#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:05,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {28493#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28493#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:05,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {28500#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28493#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:05,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {28500#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28500#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:05,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {28507#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28500#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:05,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {28507#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28507#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:05,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {28514#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28507#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:05,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {28514#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28514#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:05,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {28521#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28514#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:05,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {28521#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28521#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:05,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {28528#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28521#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:05,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {28528#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28528#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:05,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {28535#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28528#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:05,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {28535#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28535#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:05,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {28542#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28535#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:05,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {28542#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28542#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:05,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {28549#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28542#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:05,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {28549#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28549#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:05,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {28556#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28549#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:05,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {28556#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28556#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:05,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {28563#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28556#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:05,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {28563#(< main_~i~0 2020)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28563#(< main_~i~0 2020)} is VALID [2022-04-08 03:52:05,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {28563#(< main_~i~0 2020)} is VALID [2022-04-08 03:52:05,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-08 03:52:05,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-08 03:52:05,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-08 03:52:05,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27767#true} is VALID [2022-04-08 03:52:05,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27767#true} is VALID [2022-04-08 03:52:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-08 03:52:05,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432769905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:52:05,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:52:05,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-08 03:52:05,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:52:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197631845] [2022-04-08 03:52:05,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197631845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:52:05,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:52:05,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 03:52:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770944203] [2022-04-08 03:52:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:52:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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 126 [2022-04-08 03:52:05,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:52:05,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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-08 03:52:05,602 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-08 03:52:05,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 03:52:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 03:52:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 03:52:05,604 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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-08 03:52:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:06,856 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2022-04-08 03:52:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 03:52:06,856 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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 126 [2022-04-08 03:52:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:52:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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-08 03:52:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-08 03:52:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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-08 03:52:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-08 03:52:06,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 145 transitions. [2022-04-08 03:52:06,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:52:06,973 INFO L225 Difference]: With dead ends: 197 [2022-04-08 03:52:06,973 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 03:52:06,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 224 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-08 03:52:06,975 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 196 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:52:06,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 36 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:52:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 03:52:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-08 03:52:07,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:52:07,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:07,369 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:07,369 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:07,370 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-08 03:52:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-08 03:52:07,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:07,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:07,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 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 133 states. [2022-04-08 03:52:07,371 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 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 133 states. [2022-04-08 03:52:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:07,372 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-08 03:52:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-08 03:52:07,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:07,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:07,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:52:07,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:52:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-04-08 03:52:07,373 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-04-08 03:52:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:52:07,373 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-04-08 03:52:07,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 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-08 03:52:07,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 132 transitions. [2022-04-08 03:52:07,526 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-08 03:52:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-08 03:52:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 03:52:07,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:52:07,527 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:52:07,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-08 03:52:07,727 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-08 03:52:07,728 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:52:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:52:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 57 times [2022-04-08 03:52:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:07,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186318743] [2022-04-08 03:52:07,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:52:07,734 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:52:07,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:52:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 58 times [2022-04-08 03:52:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:52:07,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453401468] [2022-04-08 03:52:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:52:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:52:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:52:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:08,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {29602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29567#true} is VALID [2022-04-08 03:52:08,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-08 03:52:08,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-08 03:52:08,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:52:08,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {29602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29567#true} is VALID [2022-04-08 03:52:08,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-08 03:52:08,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-08 03:52:08,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-08 03:52:08,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29572#(= main_~i~0 0)} is VALID [2022-04-08 03:52:08,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {29572#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29572#(= main_~i~0 0)} is VALID [2022-04-08 03:52:08,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {29572#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:08,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {29573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29573#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:08,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {29573#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:08,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {29574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29574#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:08,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {29574#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:08,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {29575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29575#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:08,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {29575#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:08,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {29576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29576#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:08,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {29576#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:08,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {29577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29577#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:08,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {29577#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:08,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {29578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29578#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:08,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {29578#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:08,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {29579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29579#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:08,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {29579#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:08,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {29580#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29580#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:08,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {29580#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:08,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {29581#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29581#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:08,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {29581#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:08,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {29582#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29582#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:08,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {29582#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:08,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {29583#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29583#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:08,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {29583#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:08,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {29584#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29584#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:08,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {29584#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:08,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {29585#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29585#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:08,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {29585#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:08,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {29586#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29586#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:08,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {29586#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:08,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {29587#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29587#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:08,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {29587#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:08,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {29588#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29588#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:08,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {29588#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:08,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {29589#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29589#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:08,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {29589#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:08,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {29590#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29590#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:08,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {29590#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:08,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {29591#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29591#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:08,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {29591#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:08,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {29592#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29592#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:08,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {29592#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:08,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {29593#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29593#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:08,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {29593#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:08,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {29594#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29594#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:08,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {29594#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:08,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {29595#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29595#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:08,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {29595#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:08,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {29596#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29596#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:08,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {29596#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:08,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {29597#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29597#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:08,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {29597#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:08,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {29598#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29598#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:08,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {29598#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:08,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {29599#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29599#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:08,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {29599#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:08,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {29600#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29600#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {29600#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29601#(<= main_~i~0 29)} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {29601#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,212 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,213 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-08 03:52:08,214 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-08 03:52:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 03:52:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:52:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453401468] [2022-04-08 03:52:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453401468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:52:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828539393] [2022-04-08 03:52:08,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:52:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:52:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:52:08,217 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-08 03:52:08,218 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-08 03:52:08,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:52:08,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:52:08,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 03:52:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:08,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:52:09,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29567#true} is VALID [2022-04-08 03:52:09,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29567#true} is VALID [2022-04-08 03:52:09,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-08 03:52:09,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-08 03:52:09,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-08 03:52:09,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29621#(<= main_~i~0 0)} is VALID [2022-04-08 03:52:09,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {29621#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29621#(<= main_~i~0 0)} is VALID [2022-04-08 03:52:09,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {29621#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:09,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {29573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29573#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:09,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {29573#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:09,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {29574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29574#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:09,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {29574#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:09,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {29575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29575#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:09,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {29575#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:09,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {29576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29576#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:09,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {29576#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:09,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {29577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29577#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:09,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {29577#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:09,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {29578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29578#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:09,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {29578#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:09,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {29579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29579#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:09,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {29579#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:09,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {29580#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29580#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:09,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {29580#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:09,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {29581#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29581#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:09,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {29581#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:09,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {29582#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29582#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:09,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {29582#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:09,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {29583#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29583#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:09,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {29583#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:09,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {29584#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29584#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:09,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {29584#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:09,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {29585#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29585#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:09,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {29585#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:09,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {29586#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29586#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:09,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {29586#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:09,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {29587#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29587#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:09,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {29587#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:09,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {29588#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29588#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:09,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {29588#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:09,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {29589#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29589#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:09,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {29589#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:09,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {29590#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29590#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:09,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {29590#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:09,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {29591#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29591#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:09,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {29591#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:09,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {29592#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29592#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:09,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {29592#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:09,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {29593#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29593#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:09,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {29593#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:09,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {29594#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29594#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:09,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {29594#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:09,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {29595#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29595#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:09,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {29595#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:09,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {29596#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29596#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:09,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {29596#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:09,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {29597#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29597#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:09,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {29597#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:09,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {29598#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29598#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:09,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {29598#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:09,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {29599#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29599#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:09,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {29599#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:09,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {29600#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29600#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {29600#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29601#(<= main_~i~0 29)} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {29601#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,147 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,148 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-08 03:52:09,149 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-08 03:52:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 03:52:09,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,351 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,352 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,353 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-08 03:52:10,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-08 03:52:10,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-08 03:52:10,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {30189#(< main_~i~0 2048)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-08 03:52:10,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {30193#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30189#(< main_~i~0 2048)} is VALID [2022-04-08 03:52:10,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {30193#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30193#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:10,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {30200#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30193#(< main_~i~0 2047)} is VALID [2022-04-08 03:52:10,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {30200#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30200#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:10,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {30207#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30200#(< main_~i~0 2046)} is VALID [2022-04-08 03:52:10,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {30207#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30207#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:10,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {30214#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30207#(< main_~i~0 2045)} is VALID [2022-04-08 03:52:10,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {30214#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30214#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:10,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {30221#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30214#(< main_~i~0 2044)} is VALID [2022-04-08 03:52:10,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {30221#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30221#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:10,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {30228#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30221#(< main_~i~0 2043)} is VALID [2022-04-08 03:52:10,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {30228#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30228#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:10,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {30235#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30228#(< main_~i~0 2042)} is VALID [2022-04-08 03:52:10,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {30235#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30235#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:10,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {30242#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30235#(< main_~i~0 2041)} is VALID [2022-04-08 03:52:10,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {30242#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30242#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:10,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {30249#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30242#(< main_~i~0 2040)} is VALID [2022-04-08 03:52:10,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {30249#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30249#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:10,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {30256#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30249#(< main_~i~0 2039)} is VALID [2022-04-08 03:52:10,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {30256#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30256#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:10,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {30263#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30256#(< main_~i~0 2038)} is VALID [2022-04-08 03:52:10,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {30263#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30263#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:10,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {30270#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#(< main_~i~0 2037)} is VALID [2022-04-08 03:52:10,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {30270#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30270#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:10,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {30277#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30270#(< main_~i~0 2036)} is VALID [2022-04-08 03:52:10,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {30277#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30277#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:10,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {30284#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30277#(< main_~i~0 2035)} is VALID [2022-04-08 03:52:10,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {30284#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30284#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:10,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {30291#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30284#(< main_~i~0 2034)} is VALID [2022-04-08 03:52:10,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {30291#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30291#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:10,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {30298#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30291#(< main_~i~0 2033)} is VALID [2022-04-08 03:52:10,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {30298#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30298#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:10,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {30305#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30298#(< main_~i~0 2032)} is VALID [2022-04-08 03:52:10,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {30305#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30305#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:10,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {30312#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30305#(< main_~i~0 2031)} is VALID [2022-04-08 03:52:10,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {30312#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30312#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:10,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {30319#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30312#(< main_~i~0 2030)} is VALID [2022-04-08 03:52:10,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {30319#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30319#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:10,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {30326#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30319#(< main_~i~0 2029)} is VALID [2022-04-08 03:52:10,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {30326#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30326#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:10,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {30333#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30326#(< main_~i~0 2028)} is VALID [2022-04-08 03:52:10,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {30333#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30333#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:10,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {30340#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30333#(< main_~i~0 2027)} is VALID [2022-04-08 03:52:10,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {30340#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30340#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:10,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {30347#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30340#(< main_~i~0 2026)} is VALID [2022-04-08 03:52:10,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {30347#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30347#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:10,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {30354#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30347#(< main_~i~0 2025)} is VALID [2022-04-08 03:52:10,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {30354#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30354#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:10,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {30361#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30354#(< main_~i~0 2024)} is VALID [2022-04-08 03:52:10,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {30361#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30361#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:10,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {30368#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30361#(< main_~i~0 2023)} is VALID [2022-04-08 03:52:10,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {30368#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30368#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:10,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {30375#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30368#(< main_~i~0 2022)} is VALID [2022-04-08 03:52:10,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {30375#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30375#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:10,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {30382#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30375#(< main_~i~0 2021)} is VALID [2022-04-08 03:52:10,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {30382#(< main_~i~0 2020)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30382#(< main_~i~0 2020)} is VALID [2022-04-08 03:52:10,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {30389#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30382#(< main_~i~0 2020)} is VALID [2022-04-08 03:52:10,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {30389#(< main_~i~0 2019)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30389#(< main_~i~0 2019)} is VALID [2022-04-08 03:52:10,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {30389#(< main_~i~0 2019)} is VALID [2022-04-08 03:52:10,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-08 03:52:10,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-08 03:52:10,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-08 03:52:10,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29567#true} is VALID [2022-04-08 03:52:10,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29567#true} is VALID [2022-04-08 03:52:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 03:52:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828539393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:52:10,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:52:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-08 03:52:10,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:52:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186318743] [2022-04-08 03:52:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186318743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:52:10,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:52:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 03:52:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496383203] [2022-04-08 03:52:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:52:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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 130 [2022-04-08 03:52:10,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:52:10,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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-08 03:52:10,439 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-08 03:52:10,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 03:52:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 03:52:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 03:52:10,440 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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-08 03:52:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:11,739 INFO L93 Difference]: Finished difference Result 203 states and 206 transitions. [2022-04-08 03:52:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 03:52:11,739 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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 130 [2022-04-08 03:52:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:52:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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-08 03:52:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-08 03:52:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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-08 03:52:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-08 03:52:11,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 149 transitions. [2022-04-08 03:52:11,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:52:11,854 INFO L225 Difference]: With dead ends: 203 [2022-04-08 03:52:11,854 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 03:52:11,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-08 03:52:11,855 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:52:11,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 36 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:52:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 03:52:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 03:52:12,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:52:12,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:12,251 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:12,251 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:12,252 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-08 03:52:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-08 03:52:12,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:12,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:12,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 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 137 states. [2022-04-08 03:52:12,253 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 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 137 states. [2022-04-08 03:52:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:52:12,255 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-08 03:52:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-08 03:52:12,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:52:12,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:52:12,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:52:12,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:52:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:52:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-04-08 03:52:12,257 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2022-04-08 03:52:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:52:12,257 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-04-08 03:52:12,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 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-08 03:52:12,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 136 transitions. [2022-04-08 03:52:12,442 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-08 03:52:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-04-08 03:52:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 03:52:12,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:52:12,443 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:52:12,461 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-08 03:52:12,659 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-08 03:52:12,659 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:52:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:52:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 59 times [2022-04-08 03:52:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:52:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374143916] [2022-04-08 03:52:12,671 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:52:12,671 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:52:12,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:52:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 60 times [2022-04-08 03:52:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:52:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528052499] [2022-04-08 03:52:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:52:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:52:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:52:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:52:13,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {31459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31423#true} is VALID [2022-04-08 03:52:13,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {31423#true} assume true; {31423#true} is VALID [2022-04-08 03:52:13,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31423#true} {31423#true} #58#return; {31423#true} is VALID [2022-04-08 03:52:13,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {31423#true} call ULTIMATE.init(); {31459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:52:13,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {31459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31423#true} is VALID [2022-04-08 03:52:13,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {31423#true} assume true; {31423#true} is VALID [2022-04-08 03:52:13,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31423#true} {31423#true} #58#return; {31423#true} is VALID [2022-04-08 03:52:13,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {31423#true} call #t~ret8 := main(); {31423#true} is VALID [2022-04-08 03:52:13,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {31423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {31428#(= main_~i~0 0)} is VALID [2022-04-08 03:52:13,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {31428#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31428#(= main_~i~0 0)} is VALID [2022-04-08 03:52:13,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {31428#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31429#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:13,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {31429#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31429#(<= main_~i~0 1)} is VALID [2022-04-08 03:52:13,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {31429#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31430#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:13,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {31430#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31430#(<= main_~i~0 2)} is VALID [2022-04-08 03:52:13,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {31430#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31431#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:13,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {31431#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31431#(<= main_~i~0 3)} is VALID [2022-04-08 03:52:13,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {31431#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31432#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:13,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {31432#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31432#(<= main_~i~0 4)} is VALID [2022-04-08 03:52:13,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {31432#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31433#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:13,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {31433#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31433#(<= main_~i~0 5)} is VALID [2022-04-08 03:52:13,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {31433#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31434#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:13,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {31434#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31434#(<= main_~i~0 6)} is VALID [2022-04-08 03:52:13,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {31434#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31435#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:13,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31435#(<= main_~i~0 7)} is VALID [2022-04-08 03:52:13,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31436#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:13,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {31436#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31436#(<= main_~i~0 8)} is VALID [2022-04-08 03:52:13,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {31436#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31437#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:13,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {31437#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31437#(<= main_~i~0 9)} is VALID [2022-04-08 03:52:13,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {31437#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31438#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:13,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {31438#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31438#(<= main_~i~0 10)} is VALID [2022-04-08 03:52:13,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {31438#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31439#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:13,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {31439#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31439#(<= main_~i~0 11)} is VALID [2022-04-08 03:52:13,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {31439#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:13,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {31440#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31440#(<= main_~i~0 12)} is VALID [2022-04-08 03:52:13,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {31440#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31441#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:13,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {31441#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31441#(<= main_~i~0 13)} is VALID [2022-04-08 03:52:13,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {31441#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31442#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:13,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {31442#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31442#(<= main_~i~0 14)} is VALID [2022-04-08 03:52:13,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {31442#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31443#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:13,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {31443#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31443#(<= main_~i~0 15)} is VALID [2022-04-08 03:52:13,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {31443#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:13,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {31444#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31444#(<= main_~i~0 16)} is VALID [2022-04-08 03:52:13,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {31444#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31445#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:13,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {31445#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31445#(<= main_~i~0 17)} is VALID [2022-04-08 03:52:13,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {31445#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31446#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:13,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {31446#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31446#(<= main_~i~0 18)} is VALID [2022-04-08 03:52:13,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {31446#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31447#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:13,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {31447#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31447#(<= main_~i~0 19)} is VALID [2022-04-08 03:52:13,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {31447#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31448#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:13,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {31448#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31448#(<= main_~i~0 20)} is VALID [2022-04-08 03:52:13,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {31448#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31449#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:13,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {31449#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31449#(<= main_~i~0 21)} is VALID [2022-04-08 03:52:13,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {31449#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31450#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:13,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {31450#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31450#(<= main_~i~0 22)} is VALID [2022-04-08 03:52:13,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {31450#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:13,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {31451#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31451#(<= main_~i~0 23)} is VALID [2022-04-08 03:52:13,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {31451#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31452#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:13,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {31452#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31452#(<= main_~i~0 24)} is VALID [2022-04-08 03:52:13,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {31452#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31453#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:13,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {31453#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31453#(<= main_~i~0 25)} is VALID [2022-04-08 03:52:13,154 INFO L290 TraceCheckUtils]: 57: Hoare triple {31453#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31454#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:13,154 INFO L290 TraceCheckUtils]: 58: Hoare triple {31454#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31454#(<= main_~i~0 26)} is VALID [2022-04-08 03:52:13,154 INFO L290 TraceCheckUtils]: 59: Hoare triple {31454#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31455#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:13,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {31455#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31455#(<= main_~i~0 27)} is VALID [2022-04-08 03:52:13,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {31455#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31456#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:13,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {31456#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31456#(<= main_~i~0 28)} is VALID [2022-04-08 03:52:13,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {31456#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31457#(<= main_~i~0 29)} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {31457#(<= main_~i~0 29)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31457#(<= main_~i~0 29)} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {31457#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31458#(<= main_~i~0 30)} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {31458#(<= main_~i~0 30)} assume !(~i~0 < 2048); {31424#false} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {31424#false} ~i~0 := 0; {31424#false} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 84: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 85: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 89: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 98: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 99: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 103: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 104: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,158 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 113: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 114: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 115: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 116: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 117: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 118: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 119: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 120: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 121: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 122: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 123: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 127: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 128: Hoare triple {31424#false} assume !(~i~0 < 2048); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 129: Hoare triple {31424#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L272 TraceCheckUtils]: 130: Hoare triple {31424#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 131: Hoare triple {31424#false} ~cond := #in~cond; {31424#false} is VALID [2022-04-08 03:52:13,159 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#false} assume 0 == ~cond; {31424#false} is VALID [2022-04-08 03:52:13,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#false} assume !false; {31424#false} is VALID [2022-04-08 03:52:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-04-08 03:52:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:52:13,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528052499] [2022-04-08 03:52:13,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528052499] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:52:13,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369789162] [2022-04-08 03:52:13,161 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:52:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:52:13,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:52:13,161 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-08 03:52:13,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process