/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:15:34,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:15:34,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:15:34,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:15:34,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:15:34,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:15:34,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:15:34,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:15:34,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:15:34,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:15:34,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:15:34,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:15:34,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:15:34,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:15:34,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:15:34,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:15:34,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:15:34,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:15:34,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:15:34,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:15:34,195 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:15:34,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:15:34,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:15:34,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:15:34,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:15:34,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:15:34,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:15:34,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:15:34,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:15:34,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:15:34,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:15:34,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:15:34,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:15:34,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:15:34,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:15:34,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:15:34,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:15:34,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:15:34,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:15:34,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:15:34,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:15:34,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:15:34,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:15:34,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:15:34,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:15:34,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:15:34,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:15:34,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:15:34,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:15:34,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:15:34,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:15:34,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:15:34,223 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:15:34,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:15:34,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:15:34,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:15:34,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:15:34,424 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:15:34,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i [2022-04-15 12:15:34,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/550af01e5/61005481cee940fd8b25e000cf8f6fd1/FLAGb9aa287fd [2022-04-15 12:15:34,821 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:15:34,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i [2022-04-15 12:15:34,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/550af01e5/61005481cee940fd8b25e000cf8f6fd1/FLAGb9aa287fd [2022-04-15 12:15:34,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/550af01e5/61005481cee940fd8b25e000cf8f6fd1 [2022-04-15 12:15:34,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:15:34,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:15:34,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:15:34,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:15:34,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:15:34,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:15:34" (1/1) ... [2022-04-15 12:15:34,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b7a311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:34, skipping insertion in model container [2022-04-15 12:15:34,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:15:34" (1/1) ... [2022-04-15 12:15:34,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:15:34,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:15:35,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i[849,862] [2022-04-15 12:15:35,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:15:35,066 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:15:35,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i[849,862] [2022-04-15 12:15:35,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:15:35,097 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:15:35,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35 WrapperNode [2022-04-15 12:15:35,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:15:35,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:15:35,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:15:35,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:15:35,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:15:35,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:15:35,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:15:35,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:15:35,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (1/1) ... [2022-04-15 12:15:35,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:15:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:35,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:15:35,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:15:35,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:15:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:15:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:15:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:15:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:15:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:15:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:15:35,234 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:15:35,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:15:35,358 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:15:35,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:15:35,364 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:15:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:15:35 BoogieIcfgContainer [2022-04-15 12:15:35,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:15:35,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:15:35,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:15:35,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:15:35,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:15:34" (1/3) ... [2022-04-15 12:15:35,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f815165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:15:35, skipping insertion in model container [2022-04-15 12:15:35,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:15:35" (2/3) ... [2022-04-15 12:15:35,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f815165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:15:35, skipping insertion in model container [2022-04-15 12:15:35,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:15:35" (3/3) ... [2022-04-15 12:15:35,381 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-2.i [2022-04-15 12:15:35,385 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:15:35,385 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:15:35,438 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:15:35,445 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:15:35,445 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:15:35,457 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-15 12:15:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:15:35,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:35,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:15:35,462 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 1 times [2022-04-15 12:15:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:35,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934931183] [2022-04-15 12:15:35,478 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:15:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 2 times [2022-04-15 12:15:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:35,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248014866] [2022-04-15 12:15:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:35,618 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-15 12:15:35,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:15:35,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 12:15:35,620 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-15 12:15:35,620 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-15 12:15:35,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:15:35,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 12:15:35,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-15 12:15:35,621 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-15 12:15:35,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 12:15:35,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0; {28#false} is VALID [2022-04-15 12:15:35,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-15 12:15:35,622 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-15 12:15:35,622 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-15 12:15:35,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:15:35,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:15:35,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:15:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:15:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248014866] [2022-04-15 12:15:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248014866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:15:35,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:35,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934931183] [2022-04-15 12:15:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934931183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:35,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:35,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:15:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984989498] [2022-04-15 12:15:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:35,631 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-15 12:15:35,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:35,634 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-15 12:15:35,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:35,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:15:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:15:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:15:35,677 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-15 12:15:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:35,757 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 12:15:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:15:35,757 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-15 12:15:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:35,758 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-15 12:15:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 12:15:35,764 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-15 12:15:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 12:15:35,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 12:15:35,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:35,833 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:15:35,833 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:15:35,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:15:35,838 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-15 12:15:35,838 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-15 12:15:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:15:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:15:35,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:35,858 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-15 12:15:35,859 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-15 12:15:35,859 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-15 12:15:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:35,861 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:15:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:15:35,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:35,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:35,861 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-15 12:15:35,862 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-15 12:15:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:35,864 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:15:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:15:35,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:35,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:35,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:35,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:35,864 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-15 12:15:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 12:15:35,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-15 12:15:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:35,867 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 12:15:35,867 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-15 12:15:35,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 12:15:35,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:15:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:15:35,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:35,885 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:15:35,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:15:35,885 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 1 times [2022-04-15 12:15:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:35,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1750962350] [2022-04-15 12:15:35,887 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:15:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 2 times [2022-04-15 12:15:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:35,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691708270] [2022-04-15 12:15:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:35,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:35,933 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-15 12:15:35,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 12:15:35,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 12:15:35,935 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-15 12:15:35,935 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-15 12:15:35,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 12:15:35,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 12:15:35,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret8 := main(); {183#true} is VALID [2022-04-15 12:15:35,936 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-15 12:15:35,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~i~0 0)} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-15 12:15:35,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#false} ~i~0 := 0; {184#false} is VALID [2022-04-15 12:15:35,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-15 12:15:35,937 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-15 12:15:35,937 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-15 12:15:35,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-04-15 12:15:35,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2022-04-15 12:15:35,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-15 12:15:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:15:35,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:35,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691708270] [2022-04-15 12:15:35,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691708270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:35,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:35,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:15:35,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:35,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1750962350] [2022-04-15 12:15:35,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1750962350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:35,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:35,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:15:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036237337] [2022-04-15 12:15:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:35,940 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-15 12:15:35,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:35,941 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-15 12:15:35,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:35,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:15:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:15:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:15:35,952 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-15 12:15:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,017 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:15:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:15:36,018 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-15 12:15:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:36,018 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-15 12:15:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:15:36,027 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-15 12:15:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:15:36,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 12:15:36,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:36,059 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:15:36,060 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:15:36,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:15:36,062 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-15 12:15:36,063 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-15 12:15:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:15:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-15 12:15:36,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:36,071 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-15 12:15:36,072 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-15 12:15:36,072 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-15 12:15:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,074 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 12:15:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 12:15:36,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:36,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:36,075 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-15 12:15:36,075 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-15 12:15:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,078 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 12:15:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 12:15:36,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:36,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:36,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:36,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:36,079 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-15 12:15:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 12:15:36,080 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 12:15:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:36,080 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 12:15:36,081 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-15 12:15:36,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 12:15:36,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:15:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:15:36,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:36,099 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-15 12:15:36,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:15:36,099 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 1 times [2022-04-15 12:15:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:36,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847333149] [2022-04-15 12:15:36,120 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:36,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 2 times [2022-04-15 12:15:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:36,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444113203] [2022-04-15 12:15:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:36,227 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-15 12:15:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 12:15:36,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 12:15:36,228 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-15 12:15:36,228 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-15 12:15:36,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 12:15:36,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 12:15:36,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 12:15:36,229 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-15 12:15:36,230 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-15 12:15:36,230 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-15 12:15:36,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 12:15:36,231 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-15 12:15:36,231 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-15 12:15:36,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,232 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-15 12:15:36,232 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-15 12:15:36,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 12:15:36,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 12:15:36,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 12:15:36,233 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-15 12:15:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:36,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444113203] [2022-04-15 12:15:36,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444113203] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:36,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587243404] [2022-04-15 12:15:36,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:15:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:36,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:36,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:15:36,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:15:36,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:36,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 12:15:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:36,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:36,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-15 12:15:36,424 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-15 12:15:36,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 12:15:36,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 12:15:36,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 12:15:36,425 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-15 12:15:36,425 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-15 12:15:36,426 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-15 12:15:36,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 12:15:36,426 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-15 12:15:36,427 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-15 12:15:36,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,427 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-15 12:15:36,427 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-15 12:15:36,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 12:15:36,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 12:15:36,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 12:15:36,431 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-15 12:15:36,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:36,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 12:15:36,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 12:15:36,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 12:15:36,509 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-15 12:15:36,509 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-15 12:15:36,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,509 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-15 12:15:36,509 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-15 12:15:36,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 12:15:36,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(< main_~i~0 2048)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 12:15:36,510 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-15 12:15:36,511 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-15 12:15:36,512 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-15 12:15:36,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 12:15:36,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 12:15:36,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 12:15:36,512 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-15 12:15:36,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-15 12:15:36,513 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-15 12:15:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587243404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:36,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:36,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:15:36,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:36,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847333149] [2022-04-15 12:15:36,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847333149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:36,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:36,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:15:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712019562] [2022-04-15 12:15:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:36,515 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-15 12:15:36,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:36,515 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-15 12:15:36,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:36,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:15:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:15:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:15:36,528 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-15 12:15:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,612 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 12:15:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:15:36,614 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-15 12:15:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:36,614 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-15 12:15:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 12:15:36,616 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-15 12:15:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 12:15:36,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-15 12:15:36,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:36,648 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:15:36,648 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:15:36,649 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-15 12:15:36,653 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-15 12:15:36,657 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-15 12:15:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:15:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-15 12:15:36,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:36,667 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-15 12:15:36,667 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-15 12:15:36,667 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-15 12:15:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,674 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-15 12:15:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:15:36,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:36,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:36,675 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-15 12:15:36,675 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-15 12:15:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:36,677 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-15 12:15:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:15:36,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:36,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:36,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:36,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:36,678 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-15 12:15:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-15 12:15:36,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2022-04-15 12:15:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:36,683 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-15 12:15:36,684 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-15 12:15:36,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-15 12:15:36,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:15:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:15:36,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:36,709 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-15 12:15:36,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:36,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:36,927 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 3 times [2022-04-15 12:15:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:36,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332606618] [2022-04-15 12:15:36,942 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:36,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 4 times [2022-04-15 12:15:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:36,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913140580] [2022-04-15 12:15:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:36,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,064 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-15 12:15:37,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:15:37,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 12:15:37,065 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-15 12:15:37,065 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-15 12:15:37,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:15:37,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 12:15:37,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 12:15:37,066 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-15 12:15:37,066 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-15 12:15:37,066 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-15 12:15:37,067 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-15 12:15:37,067 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-15 12:15:37,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 12:15:37,068 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-15 12:15:37,068 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-15 12:15:37,068 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-15 12:15:37,068 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-15 12:15:37,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,069 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-15 12:15:37,069 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-15 12:15:37,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:15:37,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:15:37,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:15:37,069 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-15 12:15:37,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913140580] [2022-04-15 12:15:37,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913140580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:37,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700039522] [2022-04-15 12:15:37,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:37,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:37,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:15:37,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:37,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:37,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:15:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:37,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 12:15:37,206 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-15 12:15:37,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:15:37,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 12:15:37,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 12:15:37,215 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-15 12:15:37,216 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-15 12:15:37,217 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-15 12:15:37,219 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-15 12:15:37,219 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-15 12:15:37,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 12:15:37,220 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-15 12:15:37,220 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-15 12:15:37,220 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-15 12:15:37,220 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-15 12:15:37,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,221 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-15 12:15:37,221 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-15 12:15:37,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:15:37,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:15:37,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:15:37,222 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-15 12:15:37,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:37,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:15:37,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:15:37,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:15:37,309 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-15 12:15:37,309 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-15 12:15:37,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,309 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-15 12:15:37,309 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-15 12:15:37,309 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-15 12:15:37,309 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-15 12:15:37,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 12:15:37,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(< main_~i~0 2048)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 12:15:37,310 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-15 12:15:37,310 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-15 12:15:37,311 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-15 12:15:37,312 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-15 12:15:37,312 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-15 12:15:37,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 12:15:37,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 12:15:37,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:15:37,313 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-15 12:15:37,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 12:15:37,313 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-15 12:15:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700039522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:37,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:37,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:15:37,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332606618] [2022-04-15 12:15:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332606618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:37,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:37,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:15:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795401745] [2022-04-15 12:15:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:37,315 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-15 12:15:37,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:37,315 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-15 12:15:37,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:37,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:15:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:15:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:15:37,331 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-15 12:15:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:37,451 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 12:15:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:15:37,451 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-15 12:15:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:37,452 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-15 12:15:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 12:15:37,453 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-15 12:15:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 12:15:37,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 12:15:37,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:37,490 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:15:37,490 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:15:37,491 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-15 12:15:37,491 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:15:37,491 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.0s Time] [2022-04-15 12:15:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:15:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 12:15:37,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:37,503 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-15 12:15:37,503 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-15 12:15:37,503 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-15 12:15:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:37,504 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:15:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:15:37,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:37,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:37,505 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-15 12:15:37,505 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-15 12:15:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:37,506 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:15:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:15:37,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:37,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:37,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:37,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:37,506 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-15 12:15:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 12:15:37,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2022-04-15 12:15:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:37,507 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 12:15:37,507 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-15 12:15:37,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 12:15:37,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 12:15:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:15:37,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:37,531 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-15 12:15:37,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:37,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:15:37,742 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 5 times [2022-04-15 12:15:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:37,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91334491] [2022-04-15 12:15:37,757 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:37,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 6 times [2022-04-15 12:15:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:37,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956916981] [2022-04-15 12:15:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,872 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-15 12:15:37,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 12:15:37,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 12:15:37,873 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-15 12:15:37,873 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-15 12:15:37,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 12:15:37,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 12:15:37,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 12:15:37,874 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-15 12:15:37,874 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-15 12:15:37,874 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-15 12:15:37,875 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-15 12:15:37,875 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-15 12:15:37,875 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-15 12:15:37,876 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-15 12:15:37,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:37,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 12:15:37,877 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-15 12:15:37,878 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-15 12:15:37,878 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-15 12:15:37,878 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-15 12:15:37,878 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-15 12:15:37,878 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-15 12:15:37,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:37,879 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-15 12:15:37,879 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-15 12:15:37,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 12:15:37,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 12:15:37,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 12:15:37,880 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-15 12:15:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:37,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956916981] [2022-04-15 12:15:37,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956916981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:37,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475253392] [2022-04-15 12:15:37,881 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:15:37,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:37,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:37,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:15:37,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:15:37,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:37,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:15:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:37,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:38,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-15 12:15:38,032 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-15 12:15:38,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 12:15:38,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 12:15:38,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 12:15:38,033 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-15 12:15:38,034 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-15 12:15:38,034 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-15 12:15:38,034 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-15 12:15:38,035 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-15 12:15:38,035 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-15 12:15:38,035 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-15 12:15:38,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:38,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 12:15:38,036 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-15 12:15:38,037 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-15 12:15:38,037 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-15 12:15:38,037 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-15 12:15:38,037 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-15 12:15:38,037 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-15 12:15:38,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:38,037 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-15 12:15:38,037 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-15 12:15:38,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 12:15:38,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 12:15:38,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 12:15:38,038 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-15 12:15:38,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:38,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 12:15:38,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 12:15:38,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 12:15:38,168 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-15 12:15:38,168 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-15 12:15:38,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:38,168 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-15 12:15:38,169 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-15 12:15:38,169 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-15 12:15:38,169 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-15 12:15:38,169 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-15 12:15:38,169 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-15 12:15:38,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 12:15:38,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(< main_~i~0 2048)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 12:15:38,170 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-15 12:15:38,170 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-15 12:15:38,170 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-15 12:15:38,171 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-15 12:15:38,172 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-15 12:15:38,172 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-15 12:15:38,172 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-15 12:15:38,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 12:15:38,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 12:15:38,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 12:15:38,173 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-15 12:15:38,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-15 12:15:38,174 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-15 12:15:38,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475253392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:38,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 12:15:38,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:38,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91334491] [2022-04-15 12:15:38,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91334491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:15:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468815871] [2022-04-15 12:15:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:38,175 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-15 12:15:38,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:38,175 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-15 12:15:38,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:38,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:15:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:38,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:15:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:15:38,189 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-15 12:15:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:38,317 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 12:15:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:15:38,318 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-15 12:15:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:38,318 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-15 12:15:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 12:15:38,319 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-15 12:15:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 12:15:38,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-15 12:15:38,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:38,352 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:15:38,352 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:15:38,352 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-15 12:15:38,353 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-15 12:15:38,353 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-15 12:15:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:15:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 12:15:38,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:38,365 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-15 12:15:38,365 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-15 12:15:38,366 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-15 12:15:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:38,367 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-15 12:15:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 12:15:38,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:38,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:38,367 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-15 12:15:38,367 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-15 12:15:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:38,368 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-15 12:15:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 12:15:38,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:38,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:38,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:38,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:38,369 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-15 12:15:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 12:15:38,369 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-15 12:15:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:38,369 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 12:15:38,370 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-15 12:15:38,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 12:15:38,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 12:15:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:15:38,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:38,394 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-15 12:15:38,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:38,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:38,607 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 7 times [2022-04-15 12:15:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:38,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177737443] [2022-04-15 12:15:38,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:38,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 8 times [2022-04-15 12:15:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603234353] [2022-04-15 12:15:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:38,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:38,681 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-15 12:15:38,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 12:15:38,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 12:15:38,682 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-15 12:15:38,682 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-15 12:15:38,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 12:15:38,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 12:15:38,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 12:15:38,683 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-15 12:15:38,683 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-15 12:15:38,683 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-15 12:15:38,684 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-15 12:15:38,684 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-15 12:15:38,684 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-15 12:15:38,685 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-15 12:15:38,685 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-15 12:15:38,685 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-15 12:15:38,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 12:15:38,686 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-15 12:15:38,686 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-15 12:15:38,686 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-15 12:15:38,686 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-15 12:15:38,686 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-15 12:15:38,687 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-15 12:15:38,687 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-15 12:15:38,687 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-15 12:15:38,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,687 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-15 12:15:38,687 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-15 12:15:38,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 12:15:38,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 12:15:38,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 12:15:38,687 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-15 12:15:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:38,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603234353] [2022-04-15 12:15:38,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603234353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:38,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865315038] [2022-04-15 12:15:38,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:15:38,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:38,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:38,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:38,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:15:38,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:15:38,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:38,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:15:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:38,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:38,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-15 12:15:38,847 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-15 12:15:38,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 12:15:38,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 12:15:38,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 12:15:38,848 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-15 12:15:38,848 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-15 12:15:38,849 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-15 12:15:38,849 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-15 12:15:38,849 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-15 12:15:38,850 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-15 12:15:38,850 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-15 12:15:38,850 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-15 12:15:38,851 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-15 12:15:38,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 12:15:38,851 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-15 12:15:38,851 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-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,852 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-15 12:15:38,852 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-15 12:15:38,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 12:15:38,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 12:15:38,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 12:15:38,853 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-15 12:15:38,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:38,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 12:15:38,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 12:15:38,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 12:15:38,996 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-15 12:15:38,996 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-15 12:15:38,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,996 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 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-15 12:15:38,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 12:15:38,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 12:15:38,998 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-15 12:15:38,999 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-15 12:15:38,999 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-15 12:15:38,999 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-15 12:15:39,000 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-15 12:15:39,000 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-15 12:15:39,001 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-15 12:15:39,001 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-15 12:15:39,001 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-15 12:15:39,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 12:15:39,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 12:15:39,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 12:15:39,002 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-15 12:15:39,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-15 12:15:39,002 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-15 12:15:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865315038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:39,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:15:39,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:39,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177737443] [2022-04-15 12:15:39,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177737443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:39,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:39,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:15:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737762369] [2022-04-15 12:15:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:39,003 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-15 12:15:39,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:39,004 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-15 12:15:39,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:39,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:15:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:15:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:15:39,021 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-15 12:15:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:39,173 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 12:15:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:15:39,173 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-15 12:15:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:39,173 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-15 12:15:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 12:15:39,175 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-15 12:15:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 12:15:39,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-15 12:15:39,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:39,212 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:15:39,212 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:15:39,212 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-15 12:15:39,213 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-15 12:15:39,213 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-15 12:15:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:15:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-04-15 12:15:39,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:39,229 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-15 12:15:39,229 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-15 12:15:39,230 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-15 12:15:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:39,231 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 12:15:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:15:39,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:39,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:39,231 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-15 12:15:39,231 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-15 12:15:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:39,232 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 12:15:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:15:39,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:39,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:39,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:39,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:39,233 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-15 12:15:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-15 12:15:39,233 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-04-15 12:15:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:39,234 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-15 12:15:39,234 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-15 12:15:39,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-15 12:15:39,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:15:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:15:39,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:39,265 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-15 12:15:39,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:39,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:39,479 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 9 times [2022-04-15 12:15:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:39,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376428410] [2022-04-15 12:15:39,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:39,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 10 times [2022-04-15 12:15:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646856102] [2022-04-15 12:15:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:39,605 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-15 12:15:39,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 12:15:39,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 12:15:39,615 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-15 12:15:39,615 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-15 12:15:39,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 12:15:39,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 12:15:39,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 12:15:39,615 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-15 12:15:39,616 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-15 12:15:39,616 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-15 12:15:39,616 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-15 12:15:39,617 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-15 12:15:39,617 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-15 12:15:39,617 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-15 12:15:39,618 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-15 12:15:39,618 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-15 12:15:39,618 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-15 12:15:39,619 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-15 12:15:39,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 12:15:39,619 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-15 12:15:39,619 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-15 12:15:39,619 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-15 12:15:39,619 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-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,620 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-15 12:15:39,620 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-15 12:15:39,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 12:15:39,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 12:15:39,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 12:15:39,621 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-15 12:15:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646856102] [2022-04-15 12:15:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646856102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621097264] [2022-04-15 12:15:39,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:39,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:39,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:39,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:15:39,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:39,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:39,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:15:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:39,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:39,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 12:15:39,833 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-15 12:15:39,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 12:15:39,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 12:15:39,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 12:15:39,834 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-15 12:15:39,834 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-15 12:15:39,835 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-15 12:15:39,835 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-15 12:15:39,836 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-15 12:15:39,836 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-15 12:15:39,836 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-15 12:15:39,841 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-15 12:15:39,842 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-15 12:15:39,842 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-15 12:15:39,843 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-15 12:15:39,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 12:15:39,843 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-15 12:15:39,843 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-15 12:15:39,843 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-15 12:15:39,843 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-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,844 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-15 12:15:39,844 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-15 12:15:39,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 12:15:39,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 12:15:39,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 12:15:39,845 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-15 12:15:39,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:39,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 12:15:39,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 12:15:39,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 12:15:39,982 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-15 12:15:39,982 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-15 12:15:39,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,982 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 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-15 12:15:39,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 12:15:39,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 12:15:39,984 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-15 12:15:39,984 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-15 12:15:39,985 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-15 12:15:39,985 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-15 12:15:39,985 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-15 12:15:39,986 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-15 12:15:39,986 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-15 12:15:39,986 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-15 12:15:39,987 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-15 12:15:39,987 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-15 12:15:39,987 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-15 12:15:39,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 12:15:39,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 12:15:39,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 12:15:39,988 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-15 12:15:39,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 12:15:39,988 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-15 12:15:39,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621097264] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:39,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:39,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 12:15:39,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376428410] [2022-04-15 12:15:39,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376428410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:39,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:39,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:15:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139073439] [2022-04-15 12:15:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:39,989 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-15 12:15:39,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:39,990 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-15 12:15:40,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:40,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:15:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:15:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:15:40,005 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-15 12:15:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:40,188 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-15 12:15:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:15:40,188 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-15 12:15:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:40,189 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-15 12:15:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-15 12:15:40,190 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-15 12:15:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-15 12:15:40,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-15 12:15:40,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:40,228 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:15:40,228 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:15:40,228 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-15 12:15:40,229 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-15 12:15:40,229 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-15 12:15:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:15:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-04-15 12:15:40,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:40,249 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-15 12:15:40,249 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-15 12:15:40,249 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-15 12:15:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:40,250 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:15:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:15:40,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:40,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:40,251 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-15 12:15:40,251 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-15 12:15:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:40,252 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:15:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:15:40,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:40,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:40,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:40,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:40,252 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-15 12:15:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 12:15:40,253 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-15 12:15:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:40,253 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 12:15:40,253 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-15 12:15:40,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 12:15:40,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 12:15:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:15:40,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:40,285 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-15 12:15:40,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:40,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:40,503 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 11 times [2022-04-15 12:15:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:40,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847991116] [2022-04-15 12:15:40,512 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:40,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 12 times [2022-04-15 12:15:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:40,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243116559] [2022-04-15 12:15:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:40,589 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-15 12:15:40,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 12:15:40,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 12:15:40,590 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-15 12:15:40,590 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-15 12:15:40,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 12:15:40,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 12:15:40,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 12:15:40,591 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-15 12:15:40,591 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-15 12:15:40,591 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-15 12:15:40,592 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-15 12:15:40,592 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-15 12:15:40,592 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-15 12:15:40,593 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-15 12:15:40,593 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-15 12:15:40,593 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-15 12:15:40,593 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-15 12:15:40,594 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-15 12:15:40,594 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-15 12:15:40,594 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-15 12:15:40,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 12:15:40,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {2335#false} ~i~0 := 0; {2335#false} is VALID [2022-04-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,595 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-15 12:15:40,596 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-15 12:15:40,596 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-15 12:15:40,596 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-15 12:15:40,596 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-15 12:15:40,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {2335#false} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 12:15:40,596 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-15 12:15:40,596 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-15 12:15:40,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 12:15:40,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 12:15:40,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 12:15:40,596 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-15 12:15:40,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:40,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243116559] [2022-04-15 12:15:40,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243116559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:40,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921246848] [2022-04-15 12:15:40,597 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:15:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:40,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:15:40,789 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:15:40,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:40,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:15:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:40,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:40,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-15 12:15:40,936 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-15 12:15:40,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 12:15:40,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 12:15:40,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 12:15:40,936 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-15 12:15:40,936 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-15 12:15:40,936 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-15 12:15:40,936 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-15 12:15:40,936 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 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-15 12:15:40,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-15 12:15:40,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2407#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:40,938 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-15 12:15:40,938 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-15 12:15:40,938 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-15 12:15:40,943 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-15 12:15:40,944 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-15 12:15:40,944 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-15 12:15:40,944 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-15 12:15:40,945 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-15 12:15:40,945 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-15 12:15:40,945 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-15 12:15:40,946 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-15 12:15:40,946 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-15 12:15:40,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 12:15:40,946 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-15 12:15:40,947 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-15 12:15:40,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 12:15:40,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 12:15:40,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 12:15:40,947 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-15 12:15:40,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:41,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 12:15:41,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 12:15:41,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 12:15:41,162 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-15 12:15:41,162 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-15 12:15:41,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {2477#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 12:15:41,163 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-15 12:15:41,163 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-15 12:15:41,163 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-15 12:15:41,164 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-15 12:15:41,164 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-15 12:15:41,164 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-15 12:15:41,165 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-15 12:15:41,165 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-15 12:15:41,165 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-15 12:15:41,166 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-15 12:15:41,166 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-15 12:15:41,166 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-15 12:15:41,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2516#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:41,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,167 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-15 12:15:41,168 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-15 12:15:41,168 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-15 12:15:41,168 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-15 12:15:41,168 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-15 12:15:41,168 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-15 12:15:41,168 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-15 12:15:41,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 12:15:41,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 12:15:41,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 12:15:41,168 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-15 12:15:41,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-15 12:15:41,169 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-15 12:15:41,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921246848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:41,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:41,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 12:15:41,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:41,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847991116] [2022-04-15 12:15:41,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847991116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:41,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:41,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:15:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186246880] [2022-04-15 12:15:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:41,170 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-15 12:15:41,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:41,170 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-15 12:15:41,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:41,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:15:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:41,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:15:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:15:41,192 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-15 12:15:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:41,418 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 12:15:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:15:41,419 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-15 12:15:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:41,420 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-15 12:15:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 12:15:41,422 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-15 12:15:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 12:15:41,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-04-15 12:15:41,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:41,459 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:15:41,459 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:15:41,459 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-15 12:15:41,460 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-15 12:15:41,460 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-15 12:15:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:15:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-15 12:15:41,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:41,497 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-15 12:15:41,498 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-15 12:15:41,498 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-15 12:15:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:41,499 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 12:15:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 12:15:41,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:41,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:41,500 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-15 12:15:41,500 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-15 12:15:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:41,501 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 12:15:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 12:15:41,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:41,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:41,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:41,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:41,502 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-15 12:15:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 12:15:41,502 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2022-04-15 12:15:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:41,502 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 12:15:41,503 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-15 12:15:41,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 12:15:41,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 12:15:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:15:41,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:41,537 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-15 12:15:41,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:41,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:41,756 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 13 times [2022-04-15 12:15:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:41,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016870907] [2022-04-15 12:15:41,761 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:41,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 14 times [2022-04-15 12:15:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006171900] [2022-04-15 12:15:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:41,855 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-15 12:15:41,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 12:15:41,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 12:15:41,856 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-15 12:15:41,856 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-15 12:15:41,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 12:15:41,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 12:15:41,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 12:15:41,856 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-15 12:15:41,857 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-15 12:15:41,857 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-15 12:15:41,857 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-15 12:15:41,858 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-15 12:15:41,858 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-15 12:15:41,858 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-15 12:15:41,858 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-15 12:15:41,859 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-15 12:15:41,859 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-15 12:15:41,859 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-15 12:15:41,860 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-15 12:15:41,860 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-15 12:15:41,860 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-15 12:15:41,861 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-15 12:15:41,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:41,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 12:15:41,861 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-15 12:15:41,861 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-15 12:15:41,861 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-15 12:15:41,861 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-15 12:15:41,861 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:41,862 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-15 12:15:41,862 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-15 12:15:41,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 12:15:41,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 12:15:41,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 12:15:41,863 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-15 12:15:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006171900] [2022-04-15 12:15:41,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006171900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873302941] [2022-04-15 12:15:41,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:15:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:41,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:41,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:15:41,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:15:41,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:41,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:15:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:41,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:42,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-15 12:15:42,130 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-15 12:15:42,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 12:15:42,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 12:15:42,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 12:15:42,131 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-15 12:15:42,131 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-15 12:15:42,132 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-15 12:15:42,132 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-15 12:15:42,132 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-15 12:15:42,133 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-15 12:15:42,133 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-15 12:15:42,133 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-15 12:15:42,134 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-15 12:15:42,134 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-15 12:15:42,134 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-15 12:15:42,135 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-15 12:15:42,135 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-15 12:15:42,135 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-15 12:15:42,135 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-15 12:15:42,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:42,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,136 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:42,137 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-15 12:15:42,137 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-15 12:15:42,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 12:15:42,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 12:15:42,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 12:15:42,138 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-15 12:15:42,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:42,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 12:15:42,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 12:15:42,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 12:15:42,378 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-15 12:15:42,378 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-15 12:15:42,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:42,378 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-15 12:15:42,378 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-15 12:15:42,378 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 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-15 12:15:42,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 12:15:42,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {3106#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 12:15:42,401 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-15 12:15:42,401 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-15 12:15:42,402 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-15 12:15:42,402 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-15 12:15:42,402 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-15 12:15:42,403 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-15 12:15:42,403 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-15 12:15:42,403 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-15 12:15:42,404 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-15 12:15:42,404 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-15 12:15:42,406 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-15 12:15:42,407 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-15 12:15:42,407 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-15 12:15:42,407 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-15 12:15:42,408 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-15 12:15:42,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 12:15:42,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 12:15:42,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 12:15:42,408 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-15 12:15:42,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-15 12:15:42,408 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-15 12:15:42,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873302941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:42,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:42,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:15:42,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:42,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016870907] [2022-04-15 12:15:42,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016870907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:42,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:42,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:15:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942450895] [2022-04-15 12:15:42,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:42,410 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-15 12:15:42,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:42,410 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-15 12:15:42,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:42,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:15:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:15:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:15:42,430 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-15 12:15:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:42,653 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 12:15:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:15:42,653 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-15 12:15:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:42,653 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-15 12:15:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-15 12:15:42,654 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-15 12:15:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-15 12:15:42,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2022-04-15 12:15:42,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:42,705 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:15:42,705 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:15:42,706 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-15 12:15:42,706 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-15 12:15:42,706 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-15 12:15:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:15:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-15 12:15:42,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:42,737 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-15 12:15:42,737 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-15 12:15:42,738 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-15 12:15:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:42,739 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 12:15:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:15:42,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:42,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:42,739 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-15 12:15:42,739 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-15 12:15:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:42,740 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 12:15:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:15:42,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:42,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:42,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:42,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:42,741 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-15 12:15:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 12:15:42,742 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-04-15 12:15:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:42,742 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 12:15:42,742 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-15 12:15:42,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 12:15:42,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:15:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:15:42,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:42,780 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-15 12:15:42,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:42,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:42,996 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 15 times [2022-04-15 12:15:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581907921] [2022-04-15 12:15:43,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:43,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 16 times [2022-04-15 12:15:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:43,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671537444] [2022-04-15 12:15:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:43,104 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-15 12:15:43,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 12:15:43,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 12:15:43,105 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-15 12:15:43,105 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-15 12:15:43,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 12:15:43,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 12:15:43,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 12:15:43,106 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-15 12:15:43,106 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-15 12:15:43,106 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-15 12:15:43,106 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-15 12:15:43,107 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-15 12:15:43,107 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-15 12:15:43,107 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-15 12:15:43,108 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-15 12:15:43,108 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-15 12:15:43,108 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-15 12:15:43,109 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-15 12:15:43,109 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-15 12:15:43,109 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-15 12:15:43,115 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-15 12:15:43,116 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-15 12:15:43,116 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-15 12:15:43,116 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-15 12:15:43,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,117 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-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,118 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-15 12:15:43,118 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-15 12:15:43,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 12:15:43,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 12:15:43,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 12:15:43,119 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-15 12:15:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671537444] [2022-04-15 12:15:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671537444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631023392] [2022-04-15 12:15:43,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:43,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:43,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:43,136 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:43,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:15:43,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:43,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:43,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:15:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:43,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:43,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-15 12:15:43,393 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-15 12:15:43,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 12:15:43,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 12:15:43,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 12:15:43,393 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-15 12:15:43,394 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-15 12:15:43,394 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-15 12:15:43,394 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-15 12:15:43,395 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-15 12:15:43,395 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-15 12:15:43,395 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-15 12:15:43,396 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-15 12:15:43,396 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-15 12:15:43,396 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-15 12:15:43,397 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-15 12:15:43,397 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-15 12:15:43,397 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-15 12:15:43,398 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-15 12:15:43,398 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-15 12:15:43,398 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-15 12:15:43,399 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-15 12:15:43,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 12:15:43,399 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-15 12:15:43,399 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-15 12:15:43,399 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-15 12:15:43,399 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-15 12:15:43,399 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 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-15 12:15:43,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,400 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-15 12:15:43,401 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-15 12:15:43,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 12:15:43,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 12:15:43,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 12:15:43,401 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-15 12:15:43,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:43,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 12:15:43,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 12:15:43,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,696 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 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-15 12:15:43,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 12:15:43,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 12:15:43,698 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-15 12:15:43,698 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-15 12:15:43,698 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-15 12:15:43,699 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-15 12:15:43,699 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-15 12:15:43,699 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-15 12:15:43,700 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-15 12:15:43,700 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-15 12:15:43,700 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-15 12:15:43,701 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-15 12:15:43,701 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-15 12:15:43,701 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-15 12:15:43,702 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-15 12:15:43,702 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-15 12:15:43,703 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-15 12:15:43,703 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-15 12:15:43,704 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-15 12:15:43,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 12:15:43,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 12:15:43,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 12:15:43,704 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-15 12:15:43,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-15 12:15:43,704 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-15 12:15:43,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631023392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:43,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:43,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 12:15:43,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581907921] [2022-04-15 12:15:43,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581907921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:43,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:43,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:15:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586499557] [2022-04-15 12:15:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:43,705 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-15 12:15:43,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:43,706 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-15 12:15:43,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:43,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:15:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:15:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:15:43,727 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-15 12:15:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:43,998 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-15 12:15:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:15:43,998 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-15 12:15:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:43,998 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-15 12:15:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 12:15:44,000 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-15 12:15:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 12:15:44,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-15 12:15:44,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:44,047 INFO L225 Difference]: With dead ends: 77 [2022-04-15 12:15:44,047 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:15:44,048 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-15 12:15:44,048 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-15 12:15:44,048 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-15 12:15:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:15:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-15 12:15:44,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:44,096 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-15 12:15:44,096 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-15 12:15:44,096 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-15 12:15:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:44,097 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:15:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:15:44,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:44,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:44,097 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-15 12:15:44,097 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-15 12:15:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:44,098 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:15:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:15:44,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:44,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:44,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:44,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:44,099 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-15 12:15:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 12:15:44,099 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-04-15 12:15:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:44,099 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 12:15:44,100 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-15 12:15:44,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 12:15:44,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 12:15:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:15:44,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:44,141 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-15 12:15:44,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:44,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:15:44,353 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 17 times [2022-04-15 12:15:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387805121] [2022-04-15 12:15:44,360 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:44,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 18 times [2022-04-15 12:15:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960157601] [2022-04-15 12:15:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:44,482 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-15 12:15:44,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 12:15:44,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 12:15:44,483 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-15 12:15:44,483 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-15 12:15:44,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 12:15:44,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 12:15:44,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 12:15:44,483 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-15 12:15:44,484 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-15 12:15:44,484 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-15 12:15:44,484 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-15 12:15:44,485 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-15 12:15:44,485 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-15 12:15:44,485 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-15 12:15:44,485 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-15 12:15:44,486 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-15 12:15:44,486 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-15 12:15:44,486 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-15 12:15:44,487 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-15 12:15:44,487 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-15 12:15:44,487 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-15 12:15:44,488 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-15 12:15:44,488 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-15 12:15:44,488 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-15 12:15:44,488 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-15 12:15:44,489 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-15 12:15:44,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:44,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 12:15:44,489 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-15 12:15:44,489 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-15 12:15:44,489 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-15 12:15:44,489 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,490 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-15 12:15:44,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:44,491 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-15 12:15:44,491 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-15 12:15:44,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 12:15:44,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 12:15:44,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 12:15:44,491 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-15 12:15:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960157601] [2022-04-15 12:15:44,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960157601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336946564] [2022-04-15 12:15:44,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:15:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:44,493 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:44,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:15:45,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:15:45,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:45,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:15:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:45,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:45,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-15 12:15:45,383 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-15 12:15:45,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 12:15:45,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 12:15:45,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 12:15:45,383 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-15 12:15:45,384 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-15 12:15:45,384 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-15 12:15:45,384 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-15 12:15:45,385 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-15 12:15:45,385 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-15 12:15:45,385 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-15 12:15:45,386 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-15 12:15:45,386 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-15 12:15:45,386 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-15 12:15:45,387 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-15 12:15:45,387 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-15 12:15:45,387 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-15 12:15:45,387 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-15 12:15:45,388 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-15 12:15:45,388 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-15 12:15:45,388 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-15 12:15:45,389 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-15 12:15:45,389 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-15 12:15:45,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:45,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,390 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-15 12:15:45,391 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-15 12:15:45,391 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-15 12:15:45,391 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-15 12:15:45,391 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-15 12:15:45,391 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-15 12:15:45,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:45,391 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-15 12:15:45,391 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-15 12:15:45,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 12:15:45,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 12:15:45,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 12:15:45,391 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-15 12:15:45,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:45,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 12:15:45,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 12:15:45,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,668 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 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-15 12:15:45,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 12:15:45,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {4448#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 12:15:45,670 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-15 12:15:45,670 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-15 12:15:45,671 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-15 12:15:45,671 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-15 12:15:45,671 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-15 12:15:45,671 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-15 12:15:45,672 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-15 12:15:45,672 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-15 12:15:45,673 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-15 12:15:45,673 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-15 12:15:45,673 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-15 12:15:45,673 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-15 12:15:45,674 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-15 12:15:45,674 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-15 12:15:45,674 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-15 12:15:45,681 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-15 12:15:45,682 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-15 12:15:45,682 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-15 12:15:45,682 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-15 12:15:45,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 12:15:45,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 12:15:45,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 12:15:45,683 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-15 12:15:45,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-15 12:15:45,683 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-15 12:15:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336946564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:45,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:15:45,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:45,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387805121] [2022-04-15 12:15:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387805121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:45,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:15:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930857386] [2022-04-15 12:15:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:45,684 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-15 12:15:45,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:45,685 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-15 12:15:45,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:45,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:15:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:15:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:15:45,706 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-15 12:15:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:46,026 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-15 12:15:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:15:46,026 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-15 12:15:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:46,026 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-15 12:15:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-15 12:15:46,027 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-15 12:15:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-15 12:15:46,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2022-04-15 12:15:46,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:46,075 INFO L225 Difference]: With dead ends: 83 [2022-04-15 12:15:46,075 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:15:46,076 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-15 12:15:46,076 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-15 12:15:46,077 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-15 12:15:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:15:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 12:15:46,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:46,135 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-15 12:15:46,136 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-15 12:15:46,136 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-15 12:15:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:46,137 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-15 12:15:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 12:15:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:46,137 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-15 12:15:46,137 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-15 12:15:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:46,138 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-15 12:15:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 12:15:46,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:46,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:46,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:46,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:46,138 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-15 12:15:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 12:15:46,139 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-04-15 12:15:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:46,139 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 12:15:46,139 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-15 12:15:46,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 12:15:46,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 12:15:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:15:46,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:46,183 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-15 12:15:46,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:46,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:46,383 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 19 times [2022-04-15 12:15:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99372838] [2022-04-15 12:15:46,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:46,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 20 times [2022-04-15 12:15:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816175923] [2022-04-15 12:15:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:46,541 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-15 12:15:46,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 12:15:46,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 12:15:46,542 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-15 12:15:46,542 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-15 12:15:46,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 12:15:46,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 12:15:46,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 12:15:46,543 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-15 12:15:46,543 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-15 12:15:46,543 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-15 12:15:46,544 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-15 12:15:46,544 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-15 12:15:46,544 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-15 12:15:46,545 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-15 12:15:46,545 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-15 12:15:46,545 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-15 12:15:46,545 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-15 12:15:46,546 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-15 12:15:46,546 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-15 12:15:46,546 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-15 12:15:46,547 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-15 12:15:46,547 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-15 12:15:46,547 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-15 12:15:46,547 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-15 12:15:46,548 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-15 12:15:46,548 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-15 12:15:46,548 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-15 12:15:46,549 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-15 12:15:46,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:46,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 12:15:46,549 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-15 12:15:46,549 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-15 12:15:46,549 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-15 12:15:46,549 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-15 12:15:46,549 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-15 12:15:46,549 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,550 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-15 12:15:46,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:46,551 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-15 12:15:46,551 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-15 12:15:46,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 12:15:46,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 12:15:46,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 12:15:46,551 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-15 12:15:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816175923] [2022-04-15 12:15:46,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816175923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935473313] [2022-04-15 12:15:46,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:15:46,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:46,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:46,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:15:46,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:15:46,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:46,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:15:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:46,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:46,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-15 12:15:46,860 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-15 12:15:46,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 12:15:46,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 12:15:46,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 12:15:46,861 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-15 12:15:46,861 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-15 12:15:46,861 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-15 12:15:46,862 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-15 12:15:46,862 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-15 12:15:46,862 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-15 12:15:46,863 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-15 12:15:46,863 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-15 12:15:46,863 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-15 12:15:46,864 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-15 12:15:46,864 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-15 12:15:46,864 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-15 12:15:46,865 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-15 12:15:46,865 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-15 12:15:46,865 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-15 12:15:46,865 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-15 12:15:46,866 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-15 12:15:46,866 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-15 12:15:46,866 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-15 12:15:46,867 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-15 12:15:46,867 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-15 12:15:46,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:46,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 12:15:46,867 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,868 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-15 12:15:46,869 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-15 12:15:46,869 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-15 12:15:46,869 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-15 12:15:46,869 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-15 12:15:46,869 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-15 12:15:46,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:46,869 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-15 12:15:46,869 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-15 12:15:46,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 12:15:46,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 12:15:46,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 12:15:46,870 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-15 12:15:46,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:47,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 12:15:47,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 12:15:47,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,197 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 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-15 12:15:47,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 12:15:47,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {5203#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 12:15:47,200 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-15 12:15:47,201 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-15 12:15:47,201 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-15 12:15:47,201 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-15 12:15:47,202 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-15 12:15:47,202 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-15 12:15:47,202 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-15 12:15:47,203 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-15 12:15:47,203 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-15 12:15:47,203 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-15 12:15:47,204 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-15 12:15:47,204 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-15 12:15:47,204 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-15 12:15:47,204 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-15 12:15:47,205 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-15 12:15:47,205 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-15 12:15:47,205 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-15 12:15:47,206 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-15 12:15:47,207 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-15 12:15:47,207 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-15 12:15:47,208 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-15 12:15:47,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 12:15:47,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 12:15:47,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 12:15:47,208 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-15 12:15:47,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-15 12:15:47,208 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-15 12:15:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935473313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:47,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:47,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 12:15:47,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99372838] [2022-04-15 12:15:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99372838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:47,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:47,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:15:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851426996] [2022-04-15 12:15:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:47,210 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-15 12:15:47,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:47,210 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-15 12:15:47,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:47,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:15:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:15:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:15:47,243 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-15 12:15:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:47,572 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-15 12:15:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:15:47,572 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-15 12:15:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:47,572 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-15 12:15:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 12:15:47,573 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-15 12:15:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 12:15:47,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-15 12:15:47,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:47,622 INFO L225 Difference]: With dead ends: 89 [2022-04-15 12:15:47,622 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:15:47,623 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-15 12:15:47,623 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-15 12:15:47,623 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-15 12:15:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:15:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-15 12:15:47,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:47,691 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-15 12:15:47,691 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-15 12:15:47,691 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-15 12:15:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:47,692 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 12:15:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:15:47,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:47,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:47,692 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-15 12:15:47,692 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-15 12:15:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:47,693 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 12:15:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:15:47,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:47,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:47,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:47,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:47,693 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-15 12:15:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 12:15:47,694 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-15 12:15:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:47,694 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 12:15:47,694 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-15 12:15:47,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 12:15:47,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:15:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 12:15:47,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:47,761 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-15 12:15:47,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:47,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 12:15:47,961 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 21 times [2022-04-15 12:15:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330940055] [2022-04-15 12:15:47,968 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:47,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 22 times [2022-04-15 12:15:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947882353] [2022-04-15 12:15:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:48,102 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-15 12:15:48,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 12:15:48,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 12:15:48,102 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-15 12:15:48,102 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-15 12:15:48,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 12:15:48,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 12:15:48,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 12:15:48,103 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-15 12:15:48,103 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-15 12:15:48,103 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-15 12:15:48,104 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-15 12:15:48,104 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-15 12:15:48,104 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-15 12:15:48,105 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-15 12:15:48,105 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-15 12:15:48,105 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-15 12:15:48,106 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-15 12:15:48,106 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-15 12:15:48,106 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-15 12:15:48,107 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-15 12:15:48,107 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-15 12:15:48,107 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-15 12:15:48,107 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-15 12:15:48,108 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-15 12:15:48,108 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-15 12:15:48,108 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-15 12:15:48,109 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-15 12:15:48,109 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-15 12:15:48,109 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-15 12:15:48,110 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-15 12:15:48,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 12:15:48,110 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-15 12:15:48,110 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-15 12:15:48,110 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-15 12:15:48,110 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,111 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-15 12:15:48,112 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-15 12:15:48,112 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-15 12:15:48,112 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-15 12:15:48,112 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-15 12:15:48,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,112 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-15 12:15:48,112 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-15 12:15:48,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 12:15:48,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 12:15:48,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 12:15:48,112 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-15 12:15:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947882353] [2022-04-15 12:15:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947882353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465161115] [2022-04-15 12:15:48,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:48,114 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:48,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:15:48,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:48,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:48,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:15:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:48,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:48,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-15 12:15:48,430 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-15 12:15:48,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 12:15:48,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 12:15:48,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 12:15:48,431 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-15 12:15:48,431 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-15 12:15:48,431 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-15 12:15:48,432 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-15 12:15:48,432 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-15 12:15:48,432 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-15 12:15:48,433 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-15 12:15:48,433 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-15 12:15:48,433 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-15 12:15:48,434 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-15 12:15:48,434 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-15 12:15:48,434 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-15 12:15:48,435 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-15 12:15:48,435 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-15 12:15:48,435 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-15 12:15:48,435 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-15 12:15:48,436 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-15 12:15:48,436 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-15 12:15:48,436 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-15 12:15:48,437 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-15 12:15:48,437 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-15 12:15:48,437 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-15 12:15:48,438 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-15 12:15:48,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,438 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,439 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-15 12:15:48,440 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-15 12:15:48,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,440 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-15 12:15:48,440 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-15 12:15:48,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 12:15:48,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 12:15:48,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 12:15:48,440 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-15 12:15:48,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:48,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 12:15:48,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 12:15:48,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,780 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 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-15 12:15:48,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 12:15:48,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {6014#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 12:15:48,782 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-15 12:15:48,782 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-15 12:15:48,783 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-15 12:15:48,783 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-15 12:15:48,783 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-15 12:15:48,783 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-15 12:15:48,784 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-15 12:15:48,784 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-15 12:15:48,784 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-15 12:15:48,785 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-15 12:15:48,785 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-15 12:15:48,785 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-15 12:15:48,786 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-15 12:15:48,786 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-15 12:15:48,786 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-15 12:15:48,787 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-15 12:15:48,787 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-15 12:15:48,787 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-15 12:15:48,788 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-15 12:15:48,788 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-15 12:15:48,788 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-15 12:15:48,788 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-15 12:15:48,789 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-15 12:15:48,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 12:15:48,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 12:15:48,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 12:15:48,789 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-15 12:15:48,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-15 12:15:48,789 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-15 12:15:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465161115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:48,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:48,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 12:15:48,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:48,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330940055] [2022-04-15 12:15:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330940055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:48,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:48,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:15:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528458622] [2022-04-15 12:15:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:48,791 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-15 12:15:48,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:48,791 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-15 12:15:48,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:48,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:15:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:15:48,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:15:48,817 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-15 12:15:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:49,206 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 12:15:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:15:49,206 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-15 12:15:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:49,207 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-15 12:15:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-15 12:15:49,208 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-15 12:15:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-15 12:15:49,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 77 transitions. [2022-04-15 12:15:49,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:49,262 INFO L225 Difference]: With dead ends: 95 [2022-04-15 12:15:49,262 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:15:49,262 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-15 12:15:49,263 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-15 12:15:49,263 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-15 12:15:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:15:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-15 12:15:49,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:49,325 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-15 12:15:49,325 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-15 12:15:49,325 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-15 12:15:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:49,326 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:15:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:15:49,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:49,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:49,326 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-15 12:15:49,327 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-15 12:15:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:49,327 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:15:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:15:49,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:49,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:49,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:49,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:49,328 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-15 12:15:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-04-15 12:15:49,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-04-15 12:15:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:49,329 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-04-15 12:15:49,329 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-15 12:15:49,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 64 transitions. [2022-04-15 12:15:49,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 12:15:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:15:49,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:49,385 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-15 12:15:49,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 12:15:49,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:15:49,585 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 23 times [2022-04-15 12:15:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:49,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [906329081] [2022-04-15 12:15:49,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:49,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 24 times [2022-04-15 12:15:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:49,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176227654] [2022-04-15 12:15:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:49,773 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-15 12:15:49,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 12:15:49,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 12:15:49,774 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-15 12:15:49,774 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-15 12:15:49,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 12:15:49,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 12:15:49,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 12:15:49,774 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-15 12:15:49,775 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-15 12:15:49,775 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-15 12:15:49,775 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-15 12:15:49,776 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-15 12:15:49,776 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-15 12:15:49,776 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-15 12:15:49,776 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-15 12:15:49,777 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-15 12:15:49,777 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-15 12:15:49,777 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-15 12:15:49,778 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-15 12:15:49,778 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-15 12:15:49,778 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-15 12:15:49,779 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-15 12:15:49,779 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-15 12:15:49,779 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-15 12:15:49,780 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-15 12:15:49,780 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-15 12:15:49,780 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-15 12:15:49,781 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-15 12:15:49,781 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-15 12:15:49,781 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-15 12:15:49,782 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-15 12:15:49,782 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-15 12:15:49,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 12:15:49,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {6583#false} ~i~0 := 0; {6583#false} is VALID [2022-04-15 12:15:49,782 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,783 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {6583#false} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 12:15:49,784 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-15 12:15:49,784 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-15 12:15:49,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 12:15:49,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 12:15:49,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 12:15:49,785 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-15 12:15:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176227654] [2022-04-15 12:15:49,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176227654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334452685] [2022-04-15 12:15:49,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:15:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:49,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:49,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:15:54,631 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 12:15:54,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:54,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:15:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:54,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:54,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-15 12:15:54,874 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-15 12:15:54,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 12:15:54,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 12:15:54,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,874 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,875 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-15 12:15:54,876 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-15 12:15:54,876 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-15 12:15:54,876 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-15 12:15:54,876 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-15 12:15:54,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {6582#true} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-15 12:15:54,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6697#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:54,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {6697#(<= 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); {6697#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:54,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {6697#(<= 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-15 12:15:54,882 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-15 12:15:54,883 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-15 12:15:54,883 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-15 12:15:54,883 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-15 12:15:54,884 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-15 12:15:54,884 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-15 12:15:54,884 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-15 12:15:54,885 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-15 12:15:54,885 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-15 12:15:54,885 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-15 12:15:54,886 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-15 12:15:54,886 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-15 12:15:54,886 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-15 12:15:54,887 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-15 12:15:54,887 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-15 12:15:54,887 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-15 12:15:54,888 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-15 12:15:54,888 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-15 12:15:54,888 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-15 12:15:54,889 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-15 12:15:54,889 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-15 12:15:54,889 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-15 12:15:54,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 12:15:54,890 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-15 12:15:54,890 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-15 12:15:54,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 12:15:54,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 12:15:54,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 12:15:54,890 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-15 12:15:54,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:55,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 12:15:55,276 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 12:15:55,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 12:15:55,276 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-15 12:15:55,276 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-15 12:15:55,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {6803#(< main_~i~0 2048)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 12:15:55,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {6807#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6803#(< main_~i~0 2048)} is VALID [2022-04-15 12:15:55,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {6807#(< 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); {6807#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:55,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {6814#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6807#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:55,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {6814#(< 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); {6814#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:55,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {6821#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6814#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:55,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {6821#(< 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); {6821#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:55,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {6828#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6821#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:55,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {6828#(< 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); {6828#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:55,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {6835#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6828#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:55,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {6835#(< 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); {6835#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:55,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {6842#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6835#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:55,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {6842#(< 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); {6842#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:55,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {6849#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:55,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {6849#(< 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); {6849#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:55,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {6856#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6849#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:55,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {6856#(< 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); {6856#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:55,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {6863#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6856#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:55,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {6863#(< 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); {6863#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:55,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {6870#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6863#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:55,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {6870#(< 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); {6870#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:55,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {6877#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6870#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:55,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {6877#(< 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); {6877#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:55,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {6884#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6877#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:55,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {6884#(< 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); {6884#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:55,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6884#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:55,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {6582#true} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,285 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,286 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-15 12:15:55,287 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-15 12:15:55,287 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-15 12:15:55,287 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-15 12:15:55,287 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-15 12:15:55,287 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-15 12:15:55,287 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-15 12:15:55,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 12:15:55,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 12:15:55,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 12:15:55,287 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-15 12:15:55,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-15 12:15:55,288 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-15 12:15:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334452685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:55,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:55,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 12:15:55,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [906329081] [2022-04-15 12:15:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [906329081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:55,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:55,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:15:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507324946] [2022-04-15 12:15:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:55,289 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-15 12:15:55,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:55,289 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-15 12:15:55,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:55,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:15:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:15:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:15:55,314 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-15 12:15:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:55,729 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-15 12:15:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:15:55,730 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-15 12:15:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:55,730 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-15 12:15:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 12:15:55,731 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-15 12:15:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 12:15:55,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-15 12:15:55,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:55,790 INFO L225 Difference]: With dead ends: 101 [2022-04-15 12:15:55,790 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:15:55,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:15:55,791 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-15 12:15:55,792 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-15 12:15:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:15:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-15 12:15:55,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:55,865 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-15 12:15:55,865 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-15 12:15:55,866 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-15 12:15:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:55,867 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 12:15:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:15:55,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:55,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:55,867 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-15 12:15:55,868 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-15 12:15:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:55,868 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 12:15:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:15:55,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:55,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:55,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:55,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:55,869 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-15 12:15:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 12:15:55,870 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-04-15 12:15:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:55,870 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 12:15:55,870 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-15 12:15:55,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 12:15:55,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 12:15:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 12:15:55,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:55,931 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-15 12:15:55,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 12:15:56,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:15:56,147 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 25 times [2022-04-15 12:15:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989533138] [2022-04-15 12:15:56,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:56,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 26 times [2022-04-15 12:15:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:56,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299724287] [2022-04-15 12:15:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:56,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {7505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7486#true} is VALID [2022-04-15 12:15:56,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {7486#true} assume true; {7486#true} is VALID [2022-04-15 12:15:56,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7486#true} {7486#true} #58#return; {7486#true} is VALID [2022-04-15 12:15:56,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:15:56,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {7505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7486#true} is VALID [2022-04-15 12:15:56,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2022-04-15 12:15:56,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #58#return; {7486#true} is VALID [2022-04-15 12:15:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret8 := main(); {7486#true} is VALID [2022-04-15 12:15:56,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {7486#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; {7491#(= main_~i~0 0)} is VALID [2022-04-15 12:15:56,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {7491#(= 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; {7491#(= main_~i~0 0)} is VALID [2022-04-15 12:15:56,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {7491#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7492#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:56,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {7492#(<= 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; {7492#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:56,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {7492#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:56,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {7493#(<= 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; {7493#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:56,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {7493#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:56,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {7494#(<= 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; {7494#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:56,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {7494#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:56,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {7495#(<= 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; {7495#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:56,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {7495#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:56,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {7496#(<= 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; {7496#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:56,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {7496#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:56,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {7497#(<= 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; {7497#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:56,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {7497#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:56,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {7498#(<= 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; {7498#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:56,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {7498#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:56,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {7499#(<= 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; {7499#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:56,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {7499#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:56,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {7500#(<= 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; {7500#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:56,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {7500#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:56,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {7501#(<= 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; {7501#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:56,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {7501#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:56,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {7502#(<= 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; {7502#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:56,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {7502#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:56,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {7503#(<= 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; {7503#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:56,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {7503#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {7504#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {7487#false} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {7487#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); {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L272 TraceCheckUtils]: 62: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {7487#false} assume 0 == ~cond; {7487#false} is VALID [2022-04-15 12:15:56,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2022-04-15 12:15:56,370 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-15 12:15:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299724287] [2022-04-15 12:15:56,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299724287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3148529] [2022-04-15 12:15:56,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:15:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:56,372 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:56,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:15:56,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:15:56,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:56,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:15:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:56,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:56,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2022-04-15 12:15:56,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7486#true} is VALID [2022-04-15 12:15:56,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2022-04-15 12:15:56,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #58#return; {7486#true} is VALID [2022-04-15 12:15:56,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret8 := main(); {7486#true} is VALID [2022-04-15 12:15:56,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {7486#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; {7524#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:56,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {7524#(<= 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; {7524#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:56,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {7524#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7492#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:56,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {7492#(<= 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; {7492#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:56,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {7492#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:56,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {7493#(<= 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; {7493#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:56,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {7493#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:56,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {7494#(<= 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; {7494#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:56,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {7494#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:56,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {7495#(<= 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; {7495#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:56,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {7495#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:56,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {7496#(<= 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; {7496#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:56,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {7496#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:56,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {7497#(<= 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; {7497#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:56,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {7497#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:56,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {7498#(<= 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; {7498#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:56,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {7498#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:56,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {7499#(<= 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; {7499#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:56,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {7499#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:56,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {7500#(<= 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; {7500#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:56,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {7500#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:56,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {7501#(<= 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; {7501#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:56,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {7501#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:56,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {7502#(<= 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; {7502#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:56,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {7502#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:56,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {7503#(<= 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; {7503#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:56,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {7503#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {7504#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {7487#false} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {7487#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); {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {7487#false} assume 0 == ~cond; {7487#false} is VALID [2022-04-15 12:15:56,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2022-04-15 12:15:56,745 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-15 12:15:56,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:57,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2022-04-15 12:15:57,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {7487#false} assume 0 == ~cond; {7487#false} is VALID [2022-04-15 12:15:57,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2022-04-15 12:15:57,147 INFO L272 TraceCheckUtils]: 62: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7487#false} is VALID [2022-04-15 12:15:57,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {7487#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); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {7487#false} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7487#false} is VALID [2022-04-15 12:15:57,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2022-04-15 12:15:57,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {7804#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7487#false} is VALID [2022-04-15 12:15:57,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {7808#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7804#(< main_~i~0 2048)} is VALID [2022-04-15 12:15:57,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {7808#(< 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; {7808#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:57,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {7815#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7808#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:57,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {7815#(< 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; {7815#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:57,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {7822#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7815#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:57,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {7822#(< 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; {7822#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:57,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {7829#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7822#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:57,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {7829#(< 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; {7829#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:57,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {7836#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7829#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:57,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {7836#(< 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; {7836#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:57,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {7843#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7836#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:57,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {7843#(< 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; {7843#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:57,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {7850#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7843#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:57,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {7850#(< 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; {7850#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:57,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {7857#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7850#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:57,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {7857#(< 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; {7857#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:57,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {7864#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7857#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:57,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {7864#(< 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; {7864#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:57,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {7871#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7864#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:57,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {7871#(< 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; {7871#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:57,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {7878#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7871#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:57,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {7878#(< 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; {7878#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:57,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {7885#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7878#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:57,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {7885#(< 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; {7885#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:57,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {7892#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7885#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:57,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {7892#(< 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; {7892#(< main_~i~0 2035)} is VALID [2022-04-15 12:15:57,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {7486#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; {7892#(< main_~i~0 2035)} is VALID [2022-04-15 12:15:57,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret8 := main(); {7486#true} is VALID [2022-04-15 12:15:57,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #58#return; {7486#true} is VALID [2022-04-15 12:15:57,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2022-04-15 12:15:57,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7486#true} is VALID [2022-04-15 12:15:57,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2022-04-15 12:15:57,168 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-15 12:15:57,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3148529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:57,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:15:57,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989533138] [2022-04-15 12:15:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989533138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:57,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:15:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333058698] [2022-04-15 12:15:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:57,170 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-15 12:15:57,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:57,170 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-15 12:15:57,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:57,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:15:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:15:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:15:57,198 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-15 12:15:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:57,605 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 12:15:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:15:57,605 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-15 12:15:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:57,606 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-15 12:15:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-15 12:15:57,607 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-15 12:15:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-15 12:15:57,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 85 transitions. [2022-04-15 12:15:57,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:57,673 INFO L225 Difference]: With dead ends: 107 [2022-04-15 12:15:57,673 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 12:15:57,674 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-15 12:15:57,674 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:15:57,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 31 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:15:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 12:15:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 12:15:57,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:57,767 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-15 12:15:57,768 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-15 12:15:57,768 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-15 12:15:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:57,769 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-15 12:15:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 12:15:57,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:57,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:57,769 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-15 12:15:57,769 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-15 12:15:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:57,770 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-15 12:15:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 12:15:57,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:57,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:57,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:57,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:57,770 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-15 12:15:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 12:15:57,771 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2022-04-15 12:15:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:57,771 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 12:15:57,772 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-15 12:15:57,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 12:15:57,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:15:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 12:15:57,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:57,835 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-15 12:15:57,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:15:58,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:15:58,039 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 27 times [2022-04-15 12:15:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [848053946] [2022-04-15 12:15:58,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:58,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 28 times [2022-04-15 12:15:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:58,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058974083] [2022-04-15 12:15:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:58,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {8466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8446#true} is VALID [2022-04-15 12:15:58,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {8446#true} assume true; {8446#true} is VALID [2022-04-15 12:15:58,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8446#true} {8446#true} #58#return; {8446#true} is VALID [2022-04-15 12:15:58,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {8446#true} call ULTIMATE.init(); {8466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:15:58,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {8466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8446#true} is VALID [2022-04-15 12:15:58,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {8446#true} assume true; {8446#true} is VALID [2022-04-15 12:15:58,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8446#true} {8446#true} #58#return; {8446#true} is VALID [2022-04-15 12:15:58,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {8446#true} call #t~ret8 := main(); {8446#true} is VALID [2022-04-15 12:15:58,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {8446#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; {8451#(= main_~i~0 0)} is VALID [2022-04-15 12:15:58,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {8451#(= 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; {8451#(= main_~i~0 0)} is VALID [2022-04-15 12:15:58,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {8451#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8452#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:58,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {8452#(<= 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; {8452#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:58,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {8452#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:58,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {8453#(<= 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; {8453#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:58,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {8453#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:58,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {8454#(<= 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; {8454#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:58,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {8454#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:58,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {8455#(<= 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; {8455#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:58,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {8455#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:58,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {8456#(<= 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; {8456#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:58,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:58,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(<= 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; {8457#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:58,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {8457#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:58,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {8458#(<= 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; {8458#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:58,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {8458#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:58,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {8459#(<= 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; {8459#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:58,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {8459#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:58,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {8460#(<= 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; {8460#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:58,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {8460#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:58,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {8461#(<= 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; {8461#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:58,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {8461#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:58,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {8462#(<= 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; {8462#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:58,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {8462#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:58,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {8463#(<= 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; {8463#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:58,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {8463#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:58,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {8464#(<= 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; {8464#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:58,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {8464#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 14)} is VALID [2022-04-15 12:15:58,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {8465#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#false} ~i~0 := 0; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {8447#false} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {8447#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); {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L272 TraceCheckUtils]: 66: Hoare triple {8447#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {8447#false} ~cond := #in~cond; {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#false} assume 0 == ~cond; {8447#false} is VALID [2022-04-15 12:15:58,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#false} assume !false; {8447#false} is VALID [2022-04-15 12:15:58,227 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-15 12:15:58,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058974083] [2022-04-15 12:15:58,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058974083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014020113] [2022-04-15 12:15:58,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:58,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:58,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:58,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:15:58,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:15:58,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:58,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:58,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:15:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:58,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:58,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {8446#true} call ULTIMATE.init(); {8446#true} is VALID [2022-04-15 12:15:58,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {8446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8446#true} is VALID [2022-04-15 12:15:58,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {8446#true} assume true; {8446#true} is VALID [2022-04-15 12:15:58,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8446#true} {8446#true} #58#return; {8446#true} is VALID [2022-04-15 12:15:58,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {8446#true} call #t~ret8 := main(); {8446#true} is VALID [2022-04-15 12:15:58,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {8446#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; {8485#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:58,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {8485#(<= 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; {8485#(<= main_~i~0 0)} is VALID [2022-04-15 12:15:58,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {8485#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8452#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:58,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {8452#(<= 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; {8452#(<= main_~i~0 1)} is VALID [2022-04-15 12:15:58,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {8452#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:58,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {8453#(<= 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; {8453#(<= main_~i~0 2)} is VALID [2022-04-15 12:15:58,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {8453#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:58,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {8454#(<= 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; {8454#(<= main_~i~0 3)} is VALID [2022-04-15 12:15:58,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {8454#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:58,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {8455#(<= 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; {8455#(<= main_~i~0 4)} is VALID [2022-04-15 12:15:58,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {8455#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:58,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {8456#(<= 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; {8456#(<= main_~i~0 5)} is VALID [2022-04-15 12:15:58,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:58,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(<= 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; {8457#(<= main_~i~0 6)} is VALID [2022-04-15 12:15:58,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {8457#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:58,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {8458#(<= 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; {8458#(<= main_~i~0 7)} is VALID [2022-04-15 12:15:58,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {8458#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:58,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {8459#(<= 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; {8459#(<= main_~i~0 8)} is VALID [2022-04-15 12:15:58,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {8459#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:58,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {8460#(<= 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; {8460#(<= main_~i~0 9)} is VALID [2022-04-15 12:15:58,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {8460#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:58,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {8461#(<= 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; {8461#(<= main_~i~0 10)} is VALID [2022-04-15 12:15:58,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {8461#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:58,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {8462#(<= 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; {8462#(<= main_~i~0 11)} is VALID [2022-04-15 12:15:58,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {8462#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:58,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {8463#(<= 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; {8463#(<= main_~i~0 12)} is VALID [2022-04-15 12:15:58,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {8463#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:58,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {8464#(<= 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; {8464#(<= main_~i~0 13)} is VALID [2022-04-15 12:15:58,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {8464#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 14)} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {8465#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#false} ~i~0 := 0; {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {8447#false} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {8447#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); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L272 TraceCheckUtils]: 66: Hoare triple {8447#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 67: Hoare triple {8447#false} ~cond := #in~cond; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#false} assume 0 == ~cond; {8447#false} is VALID [2022-04-15 12:15:58,677 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#false} assume !false; {8447#false} is VALID [2022-04-15 12:15:58,678 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-15 12:15:58,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#false} assume !false; {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#false} assume 0 == ~cond; {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 67: Hoare triple {8447#false} ~cond := #in~cond; {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L272 TraceCheckUtils]: 66: Hoare triple {8447#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {8447#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); {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 64: Hoare triple {8447#false} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {8447#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8447#false} is VALID [2022-04-15 12:15:59,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#false} ~i~0 := 0; {8447#false} is VALID [2022-04-15 12:15:59,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< main_~i~0 2048)} assume !(~i~0 < 2048); {8447#false} is VALID [2022-04-15 12:15:59,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {8787#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8783#(< main_~i~0 2048)} is VALID [2022-04-15 12:15:59,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {8787#(< 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; {8787#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:59,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {8794#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8787#(< main_~i~0 2047)} is VALID [2022-04-15 12:15:59,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {8794#(< 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; {8794#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:59,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {8801#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8794#(< main_~i~0 2046)} is VALID [2022-04-15 12:15:59,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {8801#(< 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; {8801#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:59,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {8808#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8801#(< main_~i~0 2045)} is VALID [2022-04-15 12:15:59,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< 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; {8808#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:59,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {8815#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8808#(< main_~i~0 2044)} is VALID [2022-04-15 12:15:59,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {8815#(< 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; {8815#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:59,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {8822#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8815#(< main_~i~0 2043)} is VALID [2022-04-15 12:15:59,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {8822#(< 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; {8822#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:59,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {8829#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8822#(< main_~i~0 2042)} is VALID [2022-04-15 12:15:59,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {8829#(< 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; {8829#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:59,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {8836#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8829#(< main_~i~0 2041)} is VALID [2022-04-15 12:15:59,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {8836#(< 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; {8836#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:59,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {8843#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8836#(< main_~i~0 2040)} is VALID [2022-04-15 12:15:59,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {8843#(< 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; {8843#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:59,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8850#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8843#(< main_~i~0 2039)} is VALID [2022-04-15 12:15:59,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {8850#(< 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; {8850#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:59,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {8857#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8850#(< main_~i~0 2038)} is VALID [2022-04-15 12:15:59,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {8857#(< 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; {8857#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:59,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {8864#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8857#(< main_~i~0 2037)} is VALID [2022-04-15 12:15:59,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {8864#(< 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; {8864#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:59,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {8871#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8864#(< main_~i~0 2036)} is VALID [2022-04-15 12:15:59,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {8871#(< 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; {8871#(< main_~i~0 2035)} is VALID [2022-04-15 12:15:59,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {8878#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8871#(< main_~i~0 2035)} is VALID [2022-04-15 12:15:59,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {8878#(< 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; {8878#(< main_~i~0 2034)} is VALID [2022-04-15 12:15:59,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {8446#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; {8878#(< main_~i~0 2034)} is VALID [2022-04-15 12:15:59,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {8446#true} call #t~ret8 := main(); {8446#true} is VALID [2022-04-15 12:15:59,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8446#true} {8446#true} #58#return; {8446#true} is VALID [2022-04-15 12:15:59,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {8446#true} assume true; {8446#true} is VALID [2022-04-15 12:15:59,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {8446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8446#true} is VALID [2022-04-15 12:15:59,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {8446#true} call ULTIMATE.init(); {8446#true} is VALID [2022-04-15 12:15:59,141 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-15 12:15:59,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014020113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:59,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:59,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 12:15:59,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:59,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [848053946] [2022-04-15 12:15:59,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [848053946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:59,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:59,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:15:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508606810] [2022-04-15 12:15:59,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:59,142 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-15 12:15:59,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:59,142 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-15 12:15:59,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:59,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:15:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:15:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:15:59,172 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-15 12:15:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:59,637 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 12:15:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:15:59,637 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-15 12:15:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:15:59,637 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-15 12:15:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-15 12:15:59,638 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-15 12:15:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-15 12:15:59,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-15 12:15:59,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:59,705 INFO L225 Difference]: With dead ends: 113 [2022-04-15 12:15:59,705 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:15:59,706 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-15 12:15:59,706 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:15:59,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 41 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:15:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:15:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-15 12:15:59,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:59,803 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-15 12:15:59,803 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-15 12:15:59,804 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-15 12:15:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:59,804 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:15:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:15:59,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:59,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:59,805 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-15 12:15:59,805 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-15 12:15:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:59,806 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:15:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:15:59,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:59,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:59,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:59,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:59,806 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-15 12:15:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-04-15 12:15:59,807 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2022-04-15 12:15:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:59,807 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-04-15 12:15:59,807 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-15 12:15:59,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 76 transitions. [2022-04-15 12:15:59,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:15:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-04-15 12:15:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:15:59,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:59,881 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-15 12:15:59,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:00,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:00,096 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 29 times [2022-04-15 12:16:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:00,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135273481] [2022-04-15 12:16:00,103 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:00,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 30 times [2022-04-15 12:16:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779165863] [2022-04-15 12:16:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:00,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:00,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {9483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9462#true} is VALID [2022-04-15 12:16:00,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-15 12:16:00,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9462#true} {9462#true} #58#return; {9462#true} is VALID [2022-04-15 12:16:00,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {9462#true} call ULTIMATE.init(); {9483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:00,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {9483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9462#true} is VALID [2022-04-15 12:16:00,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-15 12:16:00,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9462#true} {9462#true} #58#return; {9462#true} is VALID [2022-04-15 12:16:00,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {9462#true} call #t~ret8 := main(); {9462#true} is VALID [2022-04-15 12:16:00,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {9462#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; {9467#(= main_~i~0 0)} is VALID [2022-04-15 12:16:00,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {9467#(= 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; {9467#(= main_~i~0 0)} is VALID [2022-04-15 12:16:00,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {9467#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9468#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:00,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {9468#(<= 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; {9468#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:00,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {9468#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:00,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {9469#(<= 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; {9469#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:00,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {9469#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:00,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {9470#(<= 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; {9470#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:00,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {9470#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:00,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {9471#(<= 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; {9471#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:00,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {9471#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:00,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {9472#(<= 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; {9472#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:00,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {9472#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:00,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {9473#(<= 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; {9473#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:00,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {9473#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:00,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {9474#(<= 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; {9474#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:00,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {9474#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:00,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {9475#(<= 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; {9475#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:00,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {9475#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:00,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {9476#(<= 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; {9476#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:00,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {9476#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:00,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {9477#(<= 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; {9477#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:00,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {9477#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:00,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {9478#(<= 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; {9478#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:00,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:00,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {9479#(<= 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; {9479#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:00,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {9479#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:00,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {9480#(<= 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; {9480#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:00,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {9480#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {9481#(<= 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; {9481#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {9481#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {9482#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {9463#false} ~i~0 := 0; {9463#false} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:00,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {9463#false} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:00,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {9463#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); {9463#false} is VALID [2022-04-15 12:16:00,311 INFO L272 TraceCheckUtils]: 70: Hoare triple {9463#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9463#false} is VALID [2022-04-15 12:16:00,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {9463#false} ~cond := #in~cond; {9463#false} is VALID [2022-04-15 12:16:00,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {9463#false} assume 0 == ~cond; {9463#false} is VALID [2022-04-15 12:16:00,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {9463#false} assume !false; {9463#false} is VALID [2022-04-15 12:16:00,311 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-15 12:16:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:00,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779165863] [2022-04-15 12:16:00,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779165863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:00,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674949642] [2022-04-15 12:16:00,312 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:00,313 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:00,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:16:22,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:16:22,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:22,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:16:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:22,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {9462#true} call ULTIMATE.init(); {9462#true} is VALID [2022-04-15 12:16:22,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {9462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9462#true} is VALID [2022-04-15 12:16:22,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-15 12:16:22,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9462#true} {9462#true} #58#return; {9462#true} is VALID [2022-04-15 12:16:22,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {9462#true} call #t~ret8 := main(); {9462#true} is VALID [2022-04-15 12:16:22,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {9462#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; {9502#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:22,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {9502#(<= 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; {9502#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:22,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {9502#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9468#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {9468#(<= 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; {9468#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {9468#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {9469#(<= 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; {9469#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {9469#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {9470#(<= 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; {9470#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {9470#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {9471#(<= 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; {9471#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {9471#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {9472#(<= 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; {9472#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {9472#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {9473#(<= 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; {9473#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {9473#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {9474#(<= 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; {9474#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {9474#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:22,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {9475#(<= 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; {9475#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:22,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {9475#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:22,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {9476#(<= 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; {9476#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:22,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {9476#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:22,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {9477#(<= 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; {9477#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:22,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {9477#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:22,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {9478#(<= 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; {9478#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:22,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:22,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {9479#(<= 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; {9479#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:22,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {9479#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:22,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {9480#(<= 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; {9480#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:22,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {9480#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:22,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {9481#(<= 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; {9481#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:22,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {9481#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:22,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {9482#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {9463#false} ~i~0 := 0; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {9463#false} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {9463#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); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L272 TraceCheckUtils]: 70: Hoare triple {9463#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {9463#false} ~cond := #in~cond; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {9463#false} assume 0 == ~cond; {9463#false} is VALID [2022-04-15 12:16:22,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {9463#false} assume !false; {9463#false} is VALID [2022-04-15 12:16:22,503 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-15 12:16:22,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:23,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {9463#false} assume !false; {9463#false} is VALID [2022-04-15 12:16:23,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {9463#false} assume 0 == ~cond; {9463#false} is VALID [2022-04-15 12:16:23,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {9463#false} ~cond := #in~cond; {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L272 TraceCheckUtils]: 70: Hoare triple {9463#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {9463#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); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {9463#false} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {9463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {9463#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#false} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {9463#false} ~i~0 := 0; {9463#false} is VALID [2022-04-15 12:16:23,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {9818#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9463#false} is VALID [2022-04-15 12:16:23,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {9822#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9818#(< main_~i~0 2048)} is VALID [2022-04-15 12:16:23,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {9822#(< 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; {9822#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:23,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {9829#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9822#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:23,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {9829#(< 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; {9829#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:23,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {9836#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9829#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:23,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {9836#(< 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; {9836#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:23,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {9843#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9836#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:23,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {9843#(< 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; {9843#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:23,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {9850#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9843#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:23,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {9850#(< 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; {9850#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:23,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {9857#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9850#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:23,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {9857#(< 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; {9857#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:23,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {9864#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9857#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:23,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {9864#(< 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; {9864#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:23,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {9871#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9864#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:23,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {9871#(< 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; {9871#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:23,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {9878#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9871#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:23,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {9878#(< 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; {9878#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:23,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {9885#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9878#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:23,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {9885#(< 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; {9885#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:23,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {9892#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9885#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:23,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {9892#(< 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; {9892#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:23,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {9899#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9892#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:23,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {9899#(< 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; {9899#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:23,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {9906#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9899#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:23,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {9906#(< 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; {9906#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:23,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {9913#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9906#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:23,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {9913#(< 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; {9913#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:23,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {9920#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9913#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:23,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {9920#(< 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; {9920#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:23,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {9462#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; {9920#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:23,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {9462#true} call #t~ret8 := main(); {9462#true} is VALID [2022-04-15 12:16:23,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9462#true} {9462#true} #58#return; {9462#true} is VALID [2022-04-15 12:16:23,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-15 12:16:23,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {9462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9462#true} is VALID [2022-04-15 12:16:23,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {9462#true} call ULTIMATE.init(); {9462#true} is VALID [2022-04-15 12:16:23,212 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-15 12:16:23,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674949642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:23,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:23,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 12:16:23,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:23,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135273481] [2022-04-15 12:16:23,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135273481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:16:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437594881] [2022-04-15 12:16:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:23,213 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-15 12:16:23,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:23,214 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-15 12:16:23,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:16:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:16:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:16:23,247 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-15 12:16:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,862 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 12:16:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:16:23,862 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-15 12:16:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:23,862 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-15 12:16:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-15 12:16:23,863 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-15 12:16:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-15 12:16:23,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-15 12:16:23,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,936 INFO L225 Difference]: With dead ends: 119 [2022-04-15 12:16:23,936 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 12:16:23,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:16:23,937 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:23,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 21 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 12:16:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-15 12:16:24,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:24,085 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-15 12:16:24,086 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-15 12:16:24,086 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-15 12:16:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,090 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-15 12:16:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 12:16:24,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,091 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-15 12:16:24,103 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-15 12:16:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,104 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-15 12:16:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 12:16:24,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:24,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:24,105 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-15 12:16:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 12:16:24,106 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 12:16:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:24,106 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 12:16:24,106 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-15 12:16:24,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 12:16:24,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:16:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 12:16:24,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:24,214 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-15 12:16:24,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:24,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:16:24,414 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 31 times [2022-04-15 12:16:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517956901] [2022-04-15 12:16:24,485 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:24,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 32 times [2022-04-15 12:16:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:24,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951468532] [2022-04-15 12:16:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {10556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10534#true} is VALID [2022-04-15 12:16:24,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {10534#true} assume true; {10534#true} is VALID [2022-04-15 12:16:24,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10534#true} {10534#true} #58#return; {10534#true} is VALID [2022-04-15 12:16:24,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {10534#true} call ULTIMATE.init(); {10556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:24,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {10556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10534#true} is VALID [2022-04-15 12:16:24,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {10534#true} assume true; {10534#true} is VALID [2022-04-15 12:16:24,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10534#true} {10534#true} #58#return; {10534#true} is VALID [2022-04-15 12:16:24,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {10534#true} call #t~ret8 := main(); {10534#true} is VALID [2022-04-15 12:16:24,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {10534#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; {10539#(= main_~i~0 0)} is VALID [2022-04-15 12:16:24,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {10539#(= 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; {10539#(= main_~i~0 0)} is VALID [2022-04-15 12:16:24,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {10539#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10540#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {10540#(<= 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; {10540#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {10540#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {10541#(<= 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; {10541#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {10541#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:24,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {10542#(<= 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; {10542#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:24,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {10542#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:24,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {10543#(<= 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; {10543#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:24,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {10543#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:24,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {10544#(<= 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; {10544#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:24,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {10544#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:24,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {10545#(<= 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; {10545#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:24,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {10545#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:24,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {10546#(<= 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; {10546#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:24,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {10546#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:24,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {10547#(<= 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; {10547#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:24,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {10547#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:24,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {10548#(<= 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; {10548#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:24,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {10548#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:24,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {10549#(<= 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; {10549#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:24,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {10549#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:24,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {10550#(<= 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; {10550#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:24,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {10550#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:24,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {10551#(<= 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; {10551#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:24,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {10551#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:24,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {10552#(<= 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; {10552#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:24,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {10552#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:24,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {10553#(<= 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; {10553#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:24,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {10553#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:24,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {10554#(<= 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; {10554#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:24,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {10554#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:24,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {10555#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:24,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {10535#false} ~i~0 := 0; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {10535#false} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {10535#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); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L272 TraceCheckUtils]: 74: Hoare triple {10535#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {10535#false} ~cond := #in~cond; {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {10535#false} assume 0 == ~cond; {10535#false} is VALID [2022-04-15 12:16:24,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {10535#false} assume !false; {10535#false} is VALID [2022-04-15 12:16:24,821 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-15 12:16:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951468532] [2022-04-15 12:16:24,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951468532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899791808] [2022-04-15 12:16:24,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:24,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:24,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:24,823 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:24,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:16:25,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:25,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:25,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:16:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:25,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {10534#true} call ULTIMATE.init(); {10534#true} is VALID [2022-04-15 12:16:25,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {10534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10534#true} is VALID [2022-04-15 12:16:25,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {10534#true} assume true; {10534#true} is VALID [2022-04-15 12:16:25,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10534#true} {10534#true} #58#return; {10534#true} is VALID [2022-04-15 12:16:25,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {10534#true} call #t~ret8 := main(); {10534#true} is VALID [2022-04-15 12:16:25,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {10534#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; {10575#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:25,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {10575#(<= 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; {10575#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:25,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {10575#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10540#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {10540#(<= 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; {10540#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {10540#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {10541#(<= 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; {10541#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {10541#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {10542#(<= 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; {10542#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {10542#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {10543#(<= 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; {10543#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {10543#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {10544#(<= 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; {10544#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {10544#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {10545#(<= 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; {10545#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {10545#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {10546#(<= 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; {10546#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {10546#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {10547#(<= 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; {10547#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {10547#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {10548#(<= 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; {10548#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {10548#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {10549#(<= 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; {10549#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {10549#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {10550#(<= 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; {10550#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {10550#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {10551#(<= 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; {10551#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {10551#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {10552#(<= 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; {10552#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {10552#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {10553#(<= 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; {10553#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {10553#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:25,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {10554#(<= 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; {10554#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:25,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {10554#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {10555#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {10535#false} ~i~0 := 0; {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,481 INFO L290 TraceCheckUtils]: 58: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:25,482 INFO L290 TraceCheckUtils]: 71: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {10535#false} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {10535#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); {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L272 TraceCheckUtils]: 74: Hoare triple {10535#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {10535#false} ~cond := #in~cond; {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {10535#false} assume 0 == ~cond; {10535#false} is VALID [2022-04-15 12:16:25,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {10535#false} assume !false; {10535#false} is VALID [2022-04-15 12:16:25,483 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-15 12:16:25,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {10535#false} assume !false; {10535#false} is VALID [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {10535#false} assume 0 == ~cond; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 75: Hoare triple {10535#false} ~cond := #in~cond; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L272 TraceCheckUtils]: 74: Hoare triple {10535#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 73: Hoare triple {10535#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); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 72: Hoare triple {10535#false} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 71: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 69: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 67: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {10535#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {10535#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10535#false} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {10535#false} ~i~0 := 0; {10535#false} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {10909#(< main_~i~0 2048)} assume !(~i~0 < 2048); {10535#false} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {10913#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10909#(< main_~i~0 2048)} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {10913#(< 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; {10913#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {10920#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10913#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {10920#(< 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; {10920#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {10927#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10920#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {10927#(< 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; {10927#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {10934#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10927#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {10934#(< 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; {10934#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:26,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {10941#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10934#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:26,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {10941#(< 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; {10941#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:26,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {10948#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10941#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:26,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {10948#(< 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; {10948#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:26,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {10955#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10948#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:26,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {10955#(< 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; {10955#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:26,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {10962#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10955#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:26,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {10962#(< 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; {10962#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:26,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {10969#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10962#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:26,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {10969#(< 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; {10969#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:26,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {10976#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10969#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:26,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {10976#(< 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; {10976#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:26,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {10983#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10976#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:26,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {10983#(< 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; {10983#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:26,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {10990#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10983#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:26,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {10990#(< 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; {10990#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:26,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {10997#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10990#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:26,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {10997#(< 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; {10997#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:26,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {11004#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10997#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:26,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {11004#(< 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; {11004#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:26,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {11011#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11004#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:26,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {11011#(< 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; {11011#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:26,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {11018#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11011#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:26,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {11018#(< 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; {11018#(< main_~i~0 2032)} is VALID [2022-04-15 12:16:26,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {10534#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; {11018#(< main_~i~0 2032)} is VALID [2022-04-15 12:16:26,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {10534#true} call #t~ret8 := main(); {10534#true} is VALID [2022-04-15 12:16:26,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10534#true} {10534#true} #58#return; {10534#true} is VALID [2022-04-15 12:16:26,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {10534#true} assume true; {10534#true} is VALID [2022-04-15 12:16:26,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {10534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10534#true} is VALID [2022-04-15 12:16:26,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {10534#true} call ULTIMATE.init(); {10534#true} is VALID [2022-04-15 12:16:26,148 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-15 12:16:26,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899791808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:26,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:26,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 12:16:26,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517956901] [2022-04-15 12:16:26,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517956901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:26,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:26,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:16:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088012433] [2022-04-15 12:16:26,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:26,149 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-15 12:16:26,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:26,149 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-15 12:16:26,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:26,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:16:26,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:16:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:16:26,182 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-15 12:16:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:26,878 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-15 12:16:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:16:26,878 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-15 12:16:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:26,878 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-15 12:16:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-15 12:16:26,880 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-15 12:16:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-15 12:16:26,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 97 transitions. [2022-04-15 12:16:26,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:26,961 INFO L225 Difference]: With dead ends: 125 [2022-04-15 12:16:26,961 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 12:16:26,962 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-15 12:16:26,963 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 108 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:26,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 36 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 12:16:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-15 12:16:27,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:27,100 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-15 12:16:27,100 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-15 12:16:27,100 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-15 12:16:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,111 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 12:16:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 12:16:27,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,112 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-15 12:16:27,112 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-15 12:16:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,113 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 12:16:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 12:16:27,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:27,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:27,143 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-15 12:16:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-04-15 12:16:27,144 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-04-15 12:16:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:27,145 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-04-15 12:16:27,145 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-15 12:16:27,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 84 transitions. [2022-04-15 12:16:27,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:16:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 12:16:27,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:27,227 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-15 12:16:27,248 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-15 12:16:27,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:16:27,437 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 33 times [2022-04-15 12:16:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:27,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661462450] [2022-04-15 12:16:27,445 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:27,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 34 times [2022-04-15 12:16:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:27,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054868595] [2022-04-15 12:16:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:27,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {11685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11662#true} is VALID [2022-04-15 12:16:27,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {11662#true} assume true; {11662#true} is VALID [2022-04-15 12:16:27,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11662#true} {11662#true} #58#return; {11662#true} is VALID [2022-04-15 12:16:27,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {11662#true} call ULTIMATE.init(); {11685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:27,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {11685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11662#true} is VALID [2022-04-15 12:16:27,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {11662#true} assume true; {11662#true} is VALID [2022-04-15 12:16:27,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11662#true} {11662#true} #58#return; {11662#true} is VALID [2022-04-15 12:16:27,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {11662#true} call #t~ret8 := main(); {11662#true} is VALID [2022-04-15 12:16:27,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {11662#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; {11667#(= main_~i~0 0)} is VALID [2022-04-15 12:16:27,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {11667#(= 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; {11667#(= main_~i~0 0)} is VALID [2022-04-15 12:16:27,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {11667#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11668#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:27,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {11668#(<= 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; {11668#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:27,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {11668#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11669#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:27,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {11669#(<= 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; {11669#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:27,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {11669#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11670#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:27,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {11670#(<= 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; {11670#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:27,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {11670#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11671#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:27,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {11671#(<= 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; {11671#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:27,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {11671#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11672#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:27,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {11672#(<= 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; {11672#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:27,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {11672#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11673#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:27,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {11673#(<= 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; {11673#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:27,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {11673#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11674#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:27,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {11674#(<= 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; {11674#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:27,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {11674#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11675#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:27,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {11675#(<= 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; {11675#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:27,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {11675#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11676#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:27,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {11676#(<= 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; {11676#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:27,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {11676#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11677#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:27,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {11677#(<= 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; {11677#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:27,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {11677#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11678#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {11678#(<= 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; {11678#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {11678#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11679#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {11679#(<= 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; {11679#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:27,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {11679#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11680#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:27,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {11680#(<= 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; {11680#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:27,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {11680#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11681#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:27,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {11681#(<= 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; {11681#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:27,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {11681#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11682#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:27,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {11682#(<= 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; {11682#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:27,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {11682#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11683#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:27,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {11683#(<= 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; {11683#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {11683#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11684#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {11684#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {11663#false} ~i~0 := 0; {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 70: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 73: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {11663#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11663#false} is VALID [2022-04-15 12:16:27,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {11663#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {11663#false} assume !(~i~0 < 2048); {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {11663#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); {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L272 TraceCheckUtils]: 78: Hoare triple {11663#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {11663#false} ~cond := #in~cond; {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {11663#false} assume 0 == ~cond; {11663#false} is VALID [2022-04-15 12:16:27,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {11663#false} assume !false; {11663#false} is VALID [2022-04-15 12:16:27,803 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-15 12:16:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054868595] [2022-04-15 12:16:27,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054868595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248416306] [2022-04-15 12:16:27,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:27,805 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:27,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:16:28,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:28,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:28,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:16:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:28,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {11662#true} call ULTIMATE.init(); {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {11662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {11662#true} assume true; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11662#true} {11662#true} #58#return; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {11662#true} call #t~ret8 := main(); {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {11662#true} assume !(~i~0 < 2048); {11662#true} is VALID [2022-04-15 12:16:28,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {11662#true} ~i~0 := 0; {11812#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {11812#(<= 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); {11812#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {11812#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11668#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {11668#(<= 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); {11668#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {11668#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11669#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {11669#(<= 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); {11669#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {11669#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11670#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {11670#(<= 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); {11670#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {11670#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11671#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {11671#(<= 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); {11671#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {11671#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11672#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {11672#(<= 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); {11672#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {11672#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11673#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {11673#(<= 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); {11673#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {11673#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11674#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {11674#(<= 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); {11674#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {11674#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11675#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {11675#(<= 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); {11675#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {11675#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11676#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {11676#(<= 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); {11676#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {11676#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11677#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {11677#(<= 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); {11677#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {11677#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11678#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {11678#(<= 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); {11678#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {11678#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11679#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {11679#(<= 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); {11679#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {11679#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11680#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {11680#(<= 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); {11680#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {11680#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11681#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,608 INFO L290 TraceCheckUtils]: 70: Hoare triple {11681#(<= 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); {11681#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,608 INFO L290 TraceCheckUtils]: 71: Hoare triple {11681#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11682#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,609 INFO L290 TraceCheckUtils]: 72: Hoare triple {11682#(<= 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); {11682#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,609 INFO L290 TraceCheckUtils]: 73: Hoare triple {11682#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11683#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:28,609 INFO L290 TraceCheckUtils]: 74: Hoare triple {11683#(<= 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); {11683#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 75: Hoare triple {11683#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11684#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 76: Hoare triple {11684#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11663#false} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 77: Hoare triple {11663#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); {11663#false} is VALID [2022-04-15 12:16:28,610 INFO L272 TraceCheckUtils]: 78: Hoare triple {11663#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11663#false} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 79: Hoare triple {11663#false} ~cond := #in~cond; {11663#false} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {11663#false} assume 0 == ~cond; {11663#false} is VALID [2022-04-15 12:16:28,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {11663#false} assume !false; {11663#false} is VALID [2022-04-15 12:16:28,611 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-15 12:16:28,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:29,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {11663#false} assume !false; {11663#false} is VALID [2022-04-15 12:16:29,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {11663#false} assume 0 == ~cond; {11663#false} is VALID [2022-04-15 12:16:29,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {11663#false} ~cond := #in~cond; {11663#false} is VALID [2022-04-15 12:16:29,456 INFO L272 TraceCheckUtils]: 78: Hoare triple {11663#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11663#false} is VALID [2022-04-15 12:16:29,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {11663#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); {11663#false} is VALID [2022-04-15 12:16:29,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {11948#(< main_~i~0 2048)} assume !(~i~0 < 2048); {11663#false} is VALID [2022-04-15 12:16:29,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {11952#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11948#(< main_~i~0 2048)} is VALID [2022-04-15 12:16:29,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {11952#(< 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); {11952#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:29,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {11959#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11952#(< main_~i~0 2047)} is VALID [2022-04-15 12:16:29,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {11959#(< 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); {11959#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:29,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {11966#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11959#(< main_~i~0 2046)} is VALID [2022-04-15 12:16:29,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {11966#(< 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); {11966#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:29,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {11973#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11966#(< main_~i~0 2045)} is VALID [2022-04-15 12:16:29,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {11973#(< 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); {11973#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:29,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {11980#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11973#(< main_~i~0 2044)} is VALID [2022-04-15 12:16:29,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {11980#(< 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); {11980#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:29,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {11987#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11980#(< main_~i~0 2043)} is VALID [2022-04-15 12:16:29,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {11987#(< 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); {11987#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:29,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {11994#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11987#(< main_~i~0 2042)} is VALID [2022-04-15 12:16:29,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {11994#(< 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); {11994#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:29,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {12001#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11994#(< main_~i~0 2041)} is VALID [2022-04-15 12:16:29,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {12001#(< 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); {12001#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:29,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {12008#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12001#(< main_~i~0 2040)} is VALID [2022-04-15 12:16:29,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {12008#(< 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); {12008#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:29,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {12015#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12008#(< main_~i~0 2039)} is VALID [2022-04-15 12:16:29,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {12015#(< 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); {12015#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:29,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {12022#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12015#(< main_~i~0 2038)} is VALID [2022-04-15 12:16:29,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {12022#(< 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); {12022#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:29,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {12029#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12022#(< main_~i~0 2037)} is VALID [2022-04-15 12:16:29,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {12029#(< 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); {12029#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:29,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {12036#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12029#(< main_~i~0 2036)} is VALID [2022-04-15 12:16:29,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {12036#(< 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); {12036#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:29,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {12043#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12036#(< main_~i~0 2035)} is VALID [2022-04-15 12:16:29,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {12043#(< 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); {12043#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:29,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {12050#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12043#(< main_~i~0 2034)} is VALID [2022-04-15 12:16:29,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {12050#(< 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); {12050#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:29,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {12057#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12050#(< main_~i~0 2033)} is VALID [2022-04-15 12:16:29,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {12057#(< 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); {12057#(< main_~i~0 2032)} is VALID [2022-04-15 12:16:29,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {12064#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#(< main_~i~0 2032)} is VALID [2022-04-15 12:16:29,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {12064#(< 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); {12064#(< main_~i~0 2031)} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {11662#true} ~i~0 := 0; {12064#(< main_~i~0 2031)} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {11662#true} assume !(~i~0 < 2048); {11662#true} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11662#true} is VALID [2022-04-15 12:16:29,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {11662#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; {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {11662#true} call #t~ret8 := main(); {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11662#true} {11662#true} #58#return; {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {11662#true} assume true; {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {11662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11662#true} is VALID [2022-04-15 12:16:29,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {11662#true} call ULTIMATE.init(); {11662#true} is VALID [2022-04-15 12:16:29,495 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-15 12:16:29,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248416306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:29,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:29,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 12:16:29,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:29,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661462450] [2022-04-15 12:16:29,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661462450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:29,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:29,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:16:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073384770] [2022-04-15 12:16:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:29,497 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-15 12:16:29,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:29,499 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-15 12:16:29,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:16:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:16:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:16:29,533 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-15 12:16:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,199 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-15 12:16:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:16:30,199 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-15 12:16:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:30,199 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-15 12:16:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-15 12:16:30,201 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-15 12:16:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-15 12:16:30,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 101 transitions. [2022-04-15 12:16:30,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,327 INFO L225 Difference]: With dead ends: 131 [2022-04-15 12:16:30,327 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:16:30,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:16:30,329 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:30,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 36 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:16:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-15 12:16:30,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:30,545 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-15 12:16:30,545 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-15 12:16:30,545 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-15 12:16:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,547 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:16:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:16:30,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,547 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-15 12:16:30,547 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-15 12:16:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,551 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:16:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:16:30,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:30,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:30,553 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-15 12:16:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 12:16:30,554 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-04-15 12:16:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:30,554 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 12:16:30,554 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-15 12:16:30,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 12:16:30,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 12:16:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:16:30,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:30,648 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-15 12:16:30,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:30,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:30,862 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 35 times [2022-04-15 12:16:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:30,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800748884] [2022-04-15 12:16:30,868 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:30,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 36 times [2022-04-15 12:16:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106277334] [2022-04-15 12:16:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:31,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {12870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12846#true} is VALID [2022-04-15 12:16:31,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {12846#true} assume true; {12846#true} is VALID [2022-04-15 12:16:31,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12846#true} {12846#true} #58#return; {12846#true} is VALID [2022-04-15 12:16:31,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {12846#true} call ULTIMATE.init(); {12870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:31,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {12870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12846#true} is VALID [2022-04-15 12:16:31,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {12846#true} assume true; {12846#true} is VALID [2022-04-15 12:16:31,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12846#true} {12846#true} #58#return; {12846#true} is VALID [2022-04-15 12:16:31,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {12846#true} call #t~ret8 := main(); {12846#true} is VALID [2022-04-15 12:16:31,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {12846#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; {12851#(= main_~i~0 0)} is VALID [2022-04-15 12:16:31,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {12851#(= 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; {12851#(= main_~i~0 0)} is VALID [2022-04-15 12:16:31,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {12851#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12852#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {12852#(<= 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; {12852#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {12852#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {12853#(<= 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; {12853#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {12853#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:31,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {12854#(<= 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; {12854#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:31,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {12854#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:31,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {12855#(<= 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; {12855#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:31,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {12855#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:31,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {12856#(<= 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; {12856#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:31,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {12856#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:31,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {12857#(<= 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; {12857#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:31,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {12857#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:31,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {12858#(<= 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; {12858#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:31,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {12858#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:31,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {12859#(<= 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; {12859#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:31,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {12859#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:31,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {12860#(<= 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; {12860#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:31,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {12860#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:31,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {12861#(<= 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; {12861#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:31,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {12861#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:31,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {12862#(<= 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; {12862#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:31,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {12862#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:31,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {12863#(<= 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; {12863#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:31,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {12863#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:31,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {12864#(<= 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; {12864#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:31,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {12864#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:31,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {12865#(<= 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; {12865#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:31,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {12865#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:31,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {12866#(<= 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; {12866#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:31,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {12866#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:31,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {12867#(<= 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; {12867#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:31,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {12867#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:31,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {12868#(<= 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; {12868#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:31,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {12868#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:31,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {12869#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:16:31,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2022-04-15 12:16:31,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,291 INFO L290 TraceCheckUtils]: 56: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {12847#false} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 81: Hoare triple {12847#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); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L272 TraceCheckUtils]: 82: Hoare triple {12847#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12847#false} is VALID [2022-04-15 12:16:31,293 INFO L290 TraceCheckUtils]: 83: Hoare triple {12847#false} ~cond := #in~cond; {12847#false} is VALID [2022-04-15 12:16:31,294 INFO L290 TraceCheckUtils]: 84: Hoare triple {12847#false} assume 0 == ~cond; {12847#false} is VALID [2022-04-15 12:16:31,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {12847#false} assume !false; {12847#false} is VALID [2022-04-15 12:16:31,294 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-15 12:16:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106277334] [2022-04-15 12:16:31,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106277334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652441713] [2022-04-15 12:16:31,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:31,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:31,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:31,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:31,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:17:20,130 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 12:17:20,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:17:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:20,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:20,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {12846#true} call ULTIMATE.init(); {12846#true} is VALID [2022-04-15 12:17:20,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {12846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12846#true} is VALID [2022-04-15 12:17:20,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {12846#true} assume true; {12846#true} is VALID [2022-04-15 12:17:20,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12846#true} {12846#true} #58#return; {12846#true} is VALID [2022-04-15 12:17:20,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {12846#true} call #t~ret8 := main(); {12846#true} is VALID [2022-04-15 12:17:20,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {12846#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; {12889#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:20,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {12889#(<= 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; {12889#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:20,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {12889#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12852#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:20,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {12852#(<= 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; {12852#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:20,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {12852#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:20,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {12853#(<= 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; {12853#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:20,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {12853#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:20,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {12854#(<= 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; {12854#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:20,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {12854#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:20,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {12855#(<= 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; {12855#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:20,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {12855#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:20,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {12856#(<= 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; {12856#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:20,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {12856#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:20,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {12857#(<= 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; {12857#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:20,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {12857#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:20,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {12858#(<= 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; {12858#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:20,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {12858#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:20,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {12859#(<= 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; {12859#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:20,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {12859#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:20,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {12860#(<= 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; {12860#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:20,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {12860#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:20,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {12861#(<= 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; {12861#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:20,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {12861#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:20,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {12862#(<= 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; {12862#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:20,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {12862#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:20,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {12863#(<= 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; {12863#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:20,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {12863#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:20,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {12864#(<= 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; {12864#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:20,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {12864#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:20,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {12865#(<= 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; {12865#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:20,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {12865#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:20,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {12866#(<= 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; {12866#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:20,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {12866#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:20,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {12867#(<= 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; {12867#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:20,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {12867#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:20,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {12868#(<= 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; {12868#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {12868#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {12869#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 67: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 76: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 77: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 80: Hoare triple {12847#false} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {12847#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); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L272 TraceCheckUtils]: 82: Hoare triple {12847#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {12847#false} ~cond := #in~cond; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {12847#false} assume 0 == ~cond; {12847#false} is VALID [2022-04-15 12:17:20,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {12847#false} assume !false; {12847#false} is VALID [2022-04-15 12:17:20,574 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-15 12:17:20,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:21,439 INFO L290 TraceCheckUtils]: 85: Hoare triple {12847#false} assume !false; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {12847#false} assume 0 == ~cond; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {12847#false} ~cond := #in~cond; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L272 TraceCheckUtils]: 82: Hoare triple {12847#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 81: Hoare triple {12847#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); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {12847#false} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2022-04-15 12:17:21,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {12847#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12847#false} is VALID [2022-04-15 12:17:21,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2022-04-15 12:17:21,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {13259#(< main_~i~0 2048)} assume !(~i~0 < 2048); {12847#false} is VALID [2022-04-15 12:17:21,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {13263#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13259#(< main_~i~0 2048)} is VALID [2022-04-15 12:17:21,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {13263#(< 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; {13263#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:21,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {13270#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13263#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:21,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {13270#(< 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; {13270#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:21,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {13277#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13270#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:21,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {13277#(< 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; {13277#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:21,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {13284#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13277#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:21,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {13284#(< 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; {13284#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:21,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {13291#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13284#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:21,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {13291#(< 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; {13291#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:21,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {13298#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13291#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:21,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {13298#(< 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; {13298#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:21,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {13305#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13298#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:21,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(< 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; {13305#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:21,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {13312#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13305#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:21,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {13312#(< 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; {13312#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:21,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {13319#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13312#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:21,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {13319#(< 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; {13319#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:21,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {13326#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13319#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:21,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {13326#(< 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; {13326#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:21,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {13333#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13326#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:21,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {13333#(< 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; {13333#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:21,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {13340#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13333#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:21,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {13340#(< 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; {13340#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:21,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {13347#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13340#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:21,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {13347#(< 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; {13347#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:21,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {13354#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13347#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:21,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {13354#(< 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; {13354#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:21,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {13361#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13354#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:21,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {13361#(< 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; {13361#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:21,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {13368#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13361#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:21,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {13368#(< 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; {13368#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:21,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {13375#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13368#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:21,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {13375#(< 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; {13375#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:21,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {13382#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:21,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {13382#(< 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; {13382#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:21,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {12846#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; {13382#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:21,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {12846#true} call #t~ret8 := main(); {12846#true} is VALID [2022-04-15 12:17:21,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12846#true} {12846#true} #58#return; {12846#true} is VALID [2022-04-15 12:17:21,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {12846#true} assume true; {12846#true} is VALID [2022-04-15 12:17:21,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {12846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12846#true} is VALID [2022-04-15 12:17:21,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {12846#true} call ULTIMATE.init(); {12846#true} is VALID [2022-04-15 12:17:21,464 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-15 12:17:21,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652441713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:21,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 12:17:21,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800748884] [2022-04-15 12:17:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800748884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:21,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:17:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338801379] [2022-04-15 12:17:21,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:21,466 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-15 12:17:21,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:21,466 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-15 12:17:21,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:17:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:17:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:17:21,522 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-15 12:17:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,326 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-15 12:17:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:17:22,327 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-15 12:17:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:22,327 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-15 12:17:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-15 12:17:22,328 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-15 12:17:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-15 12:17:22,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2022-04-15 12:17:22,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:22,410 INFO L225 Difference]: With dead ends: 137 [2022-04-15 12:17:22,410 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 12:17:22,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:17:22,411 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 116 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:22,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 36 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 12:17:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-15 12:17:22,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:22,636 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-15 12:17:22,636 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-15 12:17:22,636 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-15 12:17:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,638 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-15 12:17:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 12:17:22,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,638 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-15 12:17:22,638 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-15 12:17:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,639 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-15 12:17:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 12:17:22,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:22,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:22,640 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-15 12:17:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 12:17:22,641 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2022-04-15 12:17:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:22,641 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 12:17:22,641 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-15 12:17:22,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 12:17:22,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 12:17:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 12:17:22,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:22,769 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-15 12:17:22,828 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-15 12:17:22,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:22,970 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 37 times [2022-04-15 12:17:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:22,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888416584] [2022-04-15 12:17:22,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:22,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 38 times [2022-04-15 12:17:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:22,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837795285] [2022-04-15 12:17:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {14111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14086#true} is VALID [2022-04-15 12:17:23,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {14086#true} assume true; {14086#true} is VALID [2022-04-15 12:17:23,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14086#true} {14086#true} #58#return; {14086#true} is VALID [2022-04-15 12:17:23,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {14086#true} call ULTIMATE.init(); {14111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:23,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {14111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14086#true} is VALID [2022-04-15 12:17:23,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {14086#true} assume true; {14086#true} is VALID [2022-04-15 12:17:23,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14086#true} {14086#true} #58#return; {14086#true} is VALID [2022-04-15 12:17:23,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {14086#true} call #t~ret8 := main(); {14086#true} is VALID [2022-04-15 12:17:23,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {14086#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; {14091#(= main_~i~0 0)} is VALID [2022-04-15 12:17:23,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {14091#(= 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; {14091#(= main_~i~0 0)} is VALID [2022-04-15 12:17:23,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {14091#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:23,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {14092#(<= 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; {14092#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:23,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {14092#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:23,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {14093#(<= 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; {14093#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:23,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {14093#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:23,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {14094#(<= 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; {14094#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:23,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {14094#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:23,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {14095#(<= 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; {14095#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:23,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {14095#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:23,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {14096#(<= 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; {14096#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:23,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {14096#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:23,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {14097#(<= 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; {14097#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:23,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {14097#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:23,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {14098#(<= 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; {14098#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:23,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {14098#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {14099#(<= 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; {14099#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {14099#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {14100#(<= 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; {14100#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {14100#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {14101#(<= 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; {14101#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {14101#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {14102#(<= 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; {14102#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {14102#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#(<= 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; {14103#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {14103#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {14104#(<= 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; {14104#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {14104#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {14105#(<= 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; {14105#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {14105#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {14106#(<= 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; {14106#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {14106#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {14107#(<= 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; {14107#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {14107#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#(<= 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; {14108#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {14109#(<= 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; {14109#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {14109#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:23,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {14110#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:23,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {14087#false} ~i~0 := 0; {14087#false} is VALID [2022-04-15 12:17:23,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 75: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 79: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 80: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 81: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 82: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 83: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 84: Hoare triple {14087#false} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {14087#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); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L272 TraceCheckUtils]: 86: Hoare triple {14087#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 87: Hoare triple {14087#false} ~cond := #in~cond; {14087#false} is VALID [2022-04-15 12:17:23,423 INFO L290 TraceCheckUtils]: 88: Hoare triple {14087#false} assume 0 == ~cond; {14087#false} is VALID [2022-04-15 12:17:23,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {14087#false} assume !false; {14087#false} is VALID [2022-04-15 12:17:23,424 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-15 12:17:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837795285] [2022-04-15 12:17:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837795285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333372199] [2022-04-15 12:17:23,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:23,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:23,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:17:23,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:23,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:23,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:17:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:24,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {14086#true} call ULTIMATE.init(); {14086#true} is VALID [2022-04-15 12:17:24,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {14086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14086#true} is VALID [2022-04-15 12:17:24,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {14086#true} assume true; {14086#true} is VALID [2022-04-15 12:17:24,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14086#true} {14086#true} #58#return; {14086#true} is VALID [2022-04-15 12:17:24,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {14086#true} call #t~ret8 := main(); {14086#true} is VALID [2022-04-15 12:17:24,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {14086#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; {14130#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {14130#(<= 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; {14130#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {14130#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {14092#(<= 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; {14092#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {14092#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {14093#(<= 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; {14093#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {14093#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:24,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {14094#(<= 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; {14094#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:24,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {14094#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:24,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {14095#(<= 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; {14095#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:24,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {14095#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:24,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {14096#(<= 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; {14096#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:24,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {14096#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:24,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {14097#(<= 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; {14097#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:24,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {14097#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:24,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {14098#(<= 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; {14098#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:24,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {14098#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:24,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {14099#(<= 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; {14099#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:24,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {14099#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:24,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {14100#(<= 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; {14100#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:24,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {14100#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:24,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {14101#(<= 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; {14101#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:24,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {14101#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:24,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {14102#(<= 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; {14102#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:24,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {14102#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:24,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#(<= 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; {14103#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:24,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {14103#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:24,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {14104#(<= 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; {14104#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:24,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {14104#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:24,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {14105#(<= 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; {14105#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:24,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {14105#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:24,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {14106#(<= 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; {14106#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:24,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {14106#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:24,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {14107#(<= 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; {14107#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:24,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {14107#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:24,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#(<= 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; {14108#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:24,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {14109#(<= 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; {14109#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {14109#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {14110#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {14087#false} ~i~0 := 0; {14087#false} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,393 INFO L290 TraceCheckUtils]: 75: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {14087#false} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 85: Hoare triple {14087#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); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L272 TraceCheckUtils]: 86: Hoare triple {14087#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14087#false} is VALID [2022-04-15 12:17:24,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {14087#false} ~cond := #in~cond; {14087#false} is VALID [2022-04-15 12:17:24,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {14087#false} assume 0 == ~cond; {14087#false} is VALID [2022-04-15 12:17:24,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {14087#false} assume !false; {14087#false} is VALID [2022-04-15 12:17:24,395 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-15 12:17:24,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {14087#false} assume !false; {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 88: Hoare triple {14087#false} assume 0 == ~cond; {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 87: Hoare triple {14087#false} ~cond := #in~cond; {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L272 TraceCheckUtils]: 86: Hoare triple {14087#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {14087#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); {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {14087#false} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 80: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 74: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {14087#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {14087#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#false} is VALID [2022-04-15 12:17:25,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {14087#false} ~i~0 := 0; {14087#false} is VALID [2022-04-15 12:17:25,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {14518#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14087#false} is VALID [2022-04-15 12:17:25,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {14522#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14518#(< main_~i~0 2048)} is VALID [2022-04-15 12:17:25,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {14522#(< 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; {14522#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:25,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {14529#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14522#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:25,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {14529#(< 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; {14529#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:25,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {14536#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14529#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:25,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {14536#(< 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; {14536#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:25,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {14543#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14536#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:25,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {14543#(< 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; {14543#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:25,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {14550#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14543#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:25,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {14550#(< 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; {14550#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:25,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {14557#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14550#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:25,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {14557#(< 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; {14557#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:25,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {14564#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14557#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:25,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {14564#(< 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; {14564#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:25,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {14571#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14564#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:25,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {14571#(< 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; {14571#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:25,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {14578#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14571#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:25,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {14578#(< 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; {14578#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:25,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {14585#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14578#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:25,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {14585#(< 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; {14585#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:25,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {14592#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14585#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:25,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {14592#(< 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; {14592#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:25,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {14599#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14592#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:25,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {14599#(< 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; {14599#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:25,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {14606#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14599#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:25,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {14606#(< 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; {14606#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:25,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {14613#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14606#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:25,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {14613#(< 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; {14613#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:25,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {14620#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14613#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:25,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {14620#(< 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; {14620#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:25,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {14627#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14620#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:25,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {14627#(< 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; {14627#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:25,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {14634#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14627#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:25,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {14634#(< 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; {14634#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:25,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {14641#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14634#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:25,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {14641#(< 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; {14641#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:25,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {14648#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14641#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:25,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {14648#(< 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; {14648#(< main_~i~0 2029)} is VALID [2022-04-15 12:17:25,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {14086#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; {14648#(< main_~i~0 2029)} is VALID [2022-04-15 12:17:25,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {14086#true} call #t~ret8 := main(); {14086#true} is VALID [2022-04-15 12:17:25,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14086#true} {14086#true} #58#return; {14086#true} is VALID [2022-04-15 12:17:25,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {14086#true} assume true; {14086#true} is VALID [2022-04-15 12:17:25,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {14086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14086#true} is VALID [2022-04-15 12:17:25,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {14086#true} call ULTIMATE.init(); {14086#true} is VALID [2022-04-15 12:17:25,325 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-15 12:17:25,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333372199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:25,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:25,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 12:17:25,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888416584] [2022-04-15 12:17:25,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888416584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:17:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810682368] [2022-04-15 12:17:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,327 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-15 12:17:25,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,328 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-15 12:17:25,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:25,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:17:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:17:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:17:25,381 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-15 12:17:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,211 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 12:17:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:17:26,212 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-15 12:17:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:26,212 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-15 12:17:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-15 12:17:26,213 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-15 12:17:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-15 12:17:26,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 109 transitions. [2022-04-15 12:17:26,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:26,303 INFO L225 Difference]: With dead ends: 143 [2022-04-15 12:17:26,303 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 12:17:26,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:17:26,304 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 130 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:26,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 41 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 12:17:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-15 12:17:26,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:26,483 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-15 12:17:26,483 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-15 12:17:26,483 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-15 12:17:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,485 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-15 12:17:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:17:26,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,485 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-15 12:17:26,485 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-15 12:17:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,486 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-15 12:17:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:17:26,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:26,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:26,487 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-15 12:17:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-04-15 12:17:26,488 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2022-04-15 12:17:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:26,488 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-04-15 12:17:26,488 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-15 12:17:26,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 96 transitions. [2022-04-15 12:17:26,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:17:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 12:17:26,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:26,625 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-15 12:17:26,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:26,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:26,831 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 39 times [2022-04-15 12:17:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [759156994] [2022-04-15 12:17:26,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:26,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 40 times [2022-04-15 12:17:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974694996] [2022-04-15 12:17:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {15408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15382#true} is VALID [2022-04-15 12:17:27,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {15382#true} assume true; {15382#true} is VALID [2022-04-15 12:17:27,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15382#true} {15382#true} #58#return; {15382#true} is VALID [2022-04-15 12:17:27,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {15382#true} call ULTIMATE.init(); {15408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:27,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {15408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15382#true} is VALID [2022-04-15 12:17:27,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {15382#true} assume true; {15382#true} is VALID [2022-04-15 12:17:27,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15382#true} {15382#true} #58#return; {15382#true} is VALID [2022-04-15 12:17:27,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {15382#true} call #t~ret8 := main(); {15382#true} is VALID [2022-04-15 12:17:27,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {15382#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; {15387#(= main_~i~0 0)} is VALID [2022-04-15 12:17:27,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {15387#(= 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; {15387#(= main_~i~0 0)} is VALID [2022-04-15 12:17:27,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {15387#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15388#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:27,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {15388#(<= 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; {15388#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:27,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {15388#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:27,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {15389#(<= 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; {15389#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:27,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {15389#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:27,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {15390#(<= 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; {15390#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:27,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {15390#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:27,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {15391#(<= 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; {15391#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:27,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {15391#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:27,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {15392#(<= 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; {15392#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:27,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {15392#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:27,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {15393#(<= 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; {15393#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:27,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {15393#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:27,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {15394#(<= 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; {15394#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:27,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {15394#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:27,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {15395#(<= 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; {15395#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:27,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {15395#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:27,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {15396#(<= 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; {15396#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:27,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {15396#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:27,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {15397#(<= 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; {15397#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:27,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {15397#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:27,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {15398#(<= 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; {15398#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:27,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {15398#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:27,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {15399#(<= 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; {15399#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:27,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {15399#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:27,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {15400#(<= 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; {15400#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:27,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {15400#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:27,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {15401#(<= 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; {15401#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:27,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {15401#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:27,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {15402#(<= 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; {15402#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:27,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {15402#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:27,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {15403#(<= 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; {15403#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:27,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {15403#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:27,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {15404#(<= 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; {15404#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:27,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:27,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {15405#(<= 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; {15405#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:27,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {15405#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:27,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {15406#(<= 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; {15406#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {15406#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {15407#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {15383#false} ~i~0 := 0; {15383#false} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 83: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 84: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 85: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 86: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 87: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 88: Hoare triple {15383#false} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 89: Hoare triple {15383#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); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L272 TraceCheckUtils]: 90: Hoare triple {15383#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {15383#false} ~cond := #in~cond; {15383#false} is VALID [2022-04-15 12:17:27,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {15383#false} assume 0 == ~cond; {15383#false} is VALID [2022-04-15 12:17:27,252 INFO L290 TraceCheckUtils]: 93: Hoare triple {15383#false} assume !false; {15383#false} is VALID [2022-04-15 12:17:27,252 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-15 12:17:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974694996] [2022-04-15 12:17:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974694996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227405846] [2022-04-15 12:17:27,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:27,267 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:27,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:17:27,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:27,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:27,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:17:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:28,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {15382#true} call ULTIMATE.init(); {15382#true} is VALID [2022-04-15 12:17:28,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {15382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15382#true} is VALID [2022-04-15 12:17:28,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {15382#true} assume true; {15382#true} is VALID [2022-04-15 12:17:28,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15382#true} {15382#true} #58#return; {15382#true} is VALID [2022-04-15 12:17:28,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {15382#true} call #t~ret8 := main(); {15382#true} is VALID [2022-04-15 12:17:28,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {15382#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; {15427#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:28,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {15427#(<= 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; {15427#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:28,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15388#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {15388#(<= 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; {15388#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {15388#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {15389#(<= 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; {15389#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {15389#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {15390#(<= 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; {15390#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {15390#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {15391#(<= 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; {15391#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {15391#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {15392#(<= 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; {15392#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {15392#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {15393#(<= 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; {15393#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {15393#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {15394#(<= 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; {15394#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {15394#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {15395#(<= 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; {15395#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {15395#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {15396#(<= 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; {15396#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {15396#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {15397#(<= 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; {15397#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {15397#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {15398#(<= 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; {15398#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {15398#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {15399#(<= 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; {15399#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {15399#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {15400#(<= 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; {15400#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {15400#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {15401#(<= 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; {15401#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {15401#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {15402#(<= 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; {15402#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {15402#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {15403#(<= 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; {15403#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {15403#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {15404#(<= 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; {15404#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {15405#(<= 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; {15405#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {15405#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {15406#(<= 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; {15406#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {15406#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {15407#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {15383#false} ~i~0 := 0; {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 87: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {15383#false} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 89: Hoare triple {15383#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); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L272 TraceCheckUtils]: 90: Hoare triple {15383#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 91: Hoare triple {15383#false} ~cond := #in~cond; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 92: Hoare triple {15383#false} assume 0 == ~cond; {15383#false} is VALID [2022-04-15 12:17:28,201 INFO L290 TraceCheckUtils]: 93: Hoare triple {15383#false} assume !false; {15383#false} is VALID [2022-04-15 12:17:28,202 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-15 12:17:28,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:29,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {15383#false} assume !false; {15383#false} is VALID [2022-04-15 12:17:29,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {15383#false} assume 0 == ~cond; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {15383#false} ~cond := #in~cond; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L272 TraceCheckUtils]: 90: Hoare triple {15383#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {15383#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); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {15383#false} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 87: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 86: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 64: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {15383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15383#false} is VALID [2022-04-15 12:17:29,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {15383#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15383#false} is VALID [2022-04-15 12:17:29,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {15383#false} ~i~0 := 0; {15383#false} is VALID [2022-04-15 12:17:29,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {15833#(< main_~i~0 2048)} assume !(~i~0 < 2048); {15383#false} is VALID [2022-04-15 12:17:29,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {15837#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15833#(< main_~i~0 2048)} is VALID [2022-04-15 12:17:29,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {15837#(< 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; {15837#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:29,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {15844#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15837#(< main_~i~0 2047)} is VALID [2022-04-15 12:17:29,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {15844#(< 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; {15844#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:29,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {15851#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15844#(< main_~i~0 2046)} is VALID [2022-04-15 12:17:29,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {15851#(< 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; {15851#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:29,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {15858#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15851#(< main_~i~0 2045)} is VALID [2022-04-15 12:17:29,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {15858#(< 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; {15858#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:29,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {15865#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15858#(< main_~i~0 2044)} is VALID [2022-04-15 12:17:29,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {15865#(< 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; {15865#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:29,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {15872#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15865#(< main_~i~0 2043)} is VALID [2022-04-15 12:17:29,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {15872#(< 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; {15872#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:29,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {15879#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15872#(< main_~i~0 2042)} is VALID [2022-04-15 12:17:29,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {15879#(< 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; {15879#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:29,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {15886#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15879#(< main_~i~0 2041)} is VALID [2022-04-15 12:17:29,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {15886#(< 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; {15886#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:29,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {15893#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15886#(< main_~i~0 2040)} is VALID [2022-04-15 12:17:29,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {15893#(< 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; {15893#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:29,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {15900#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15893#(< main_~i~0 2039)} is VALID [2022-04-15 12:17:29,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {15900#(< 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; {15900#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:29,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {15907#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15900#(< main_~i~0 2038)} is VALID [2022-04-15 12:17:29,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {15907#(< 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; {15907#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:29,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {15914#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15907#(< main_~i~0 2037)} is VALID [2022-04-15 12:17:29,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {15914#(< 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; {15914#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:29,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {15921#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15914#(< main_~i~0 2036)} is VALID [2022-04-15 12:17:29,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {15921#(< 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; {15921#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:29,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {15928#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15921#(< main_~i~0 2035)} is VALID [2022-04-15 12:17:29,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {15928#(< 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; {15928#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:29,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {15935#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15928#(< main_~i~0 2034)} is VALID [2022-04-15 12:17:29,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {15935#(< 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; {15935#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:29,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {15942#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15935#(< main_~i~0 2033)} is VALID [2022-04-15 12:17:29,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {15942#(< 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; {15942#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:29,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {15949#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15942#(< main_~i~0 2032)} is VALID [2022-04-15 12:17:29,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {15949#(< 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; {15949#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:29,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {15956#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15949#(< main_~i~0 2031)} is VALID [2022-04-15 12:17:29,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {15956#(< 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; {15956#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:29,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {15963#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15956#(< main_~i~0 2030)} is VALID [2022-04-15 12:17:29,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {15963#(< 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; {15963#(< main_~i~0 2029)} is VALID [2022-04-15 12:17:29,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {15970#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15963#(< main_~i~0 2029)} is VALID [2022-04-15 12:17:29,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {15970#(< 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; {15970#(< main_~i~0 2028)} is VALID [2022-04-15 12:17:29,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {15382#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; {15970#(< main_~i~0 2028)} is VALID [2022-04-15 12:17:29,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {15382#true} call #t~ret8 := main(); {15382#true} is VALID [2022-04-15 12:17:29,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15382#true} {15382#true} #58#return; {15382#true} is VALID [2022-04-15 12:17:29,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {15382#true} assume true; {15382#true} is VALID [2022-04-15 12:17:29,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {15382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {15382#true} is VALID [2022-04-15 12:17:29,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {15382#true} call ULTIMATE.init(); {15382#true} is VALID [2022-04-15 12:17:29,248 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-15 12:17:29,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227405846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:29,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:29,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 12:17:29,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [759156994] [2022-04-15 12:17:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [759156994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:17:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25033328] [2022-04-15 12:17:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:29,251 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-15 12:17:29,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:29,252 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-15 12:17:29,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:29,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:17:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:17:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:17:29,304 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-15 12:17:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,235 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2022-04-15 12:17:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:17:30,235 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-15 12:17:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:30,236 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-15 12:17:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-15 12:17:30,237 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-15 12:17:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-15 12:17:30,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 113 transitions. [2022-04-15 12:17:30,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,335 INFO L225 Difference]: With dead ends: 149 [2022-04-15 12:17:30,335 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 12:17:30,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:17:30,337 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:30,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 41 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 12:17:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-15 12:17:30,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:30,546 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-15 12:17:30,546 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-15 12:17:30,546 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-15 12:17:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,559 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 12:17:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:17:30,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:30,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:30,560 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-15 12:17:30,560 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-15 12:17:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,561 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 12:17:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:17:30,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:30,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:30,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:30,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:30,562 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-15 12:17:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 12:17:30,563 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-15 12:17:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:30,563 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 12:17:30,564 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-15 12:17:30,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 12:17:30,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 12:17:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 12:17:30,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:30,697 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-15 12:17:30,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:30,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 12:17:30,907 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 41 times [2022-04-15 12:17:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [862619170] [2022-04-15 12:17:30,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:30,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 42 times [2022-04-15 12:17:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3689964] [2022-04-15 12:17:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {16761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16734#true} is VALID [2022-04-15 12:17:31,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {16734#true} assume true; {16734#true} is VALID [2022-04-15 12:17:31,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16734#true} {16734#true} #58#return; {16734#true} is VALID [2022-04-15 12:17:31,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {16734#true} call ULTIMATE.init(); {16761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:31,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {16761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16734#true} is VALID [2022-04-15 12:17:31,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {16734#true} assume true; {16734#true} is VALID [2022-04-15 12:17:31,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16734#true} {16734#true} #58#return; {16734#true} is VALID [2022-04-15 12:17:31,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {16734#true} call #t~ret8 := main(); {16734#true} is VALID [2022-04-15 12:17:31,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {16734#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; {16739#(= main_~i~0 0)} is VALID [2022-04-15 12:17:31,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {16739#(= 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; {16739#(= main_~i~0 0)} is VALID [2022-04-15 12:17:31,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {16739#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16740#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:31,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {16740#(<= 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; {16740#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:31,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {16740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16741#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:31,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {16741#(<= 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; {16741#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:31,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {16741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16742#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:31,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {16742#(<= 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; {16742#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:31,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {16742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16743#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:31,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {16743#(<= 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; {16743#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:31,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {16743#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16744#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:31,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {16744#(<= 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; {16744#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:31,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {16744#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16745#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:31,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {16745#(<= 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; {16745#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:31,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {16745#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16746#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:31,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {16746#(<= 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; {16746#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:31,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {16746#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16747#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:31,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {16747#(<= 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; {16747#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:31,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {16747#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16748#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:31,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {16748#(<= 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; {16748#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:31,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {16748#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16749#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:31,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {16749#(<= 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; {16749#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:31,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {16749#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16750#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:31,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {16750#(<= 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; {16750#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:31,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {16750#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16751#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:31,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {16751#(<= 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; {16751#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:31,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {16751#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16752#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:31,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {16752#(<= 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; {16752#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:31,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {16752#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16753#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:31,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {16753#(<= 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; {16753#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:31,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {16753#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16754#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:31,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {16754#(<= 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; {16754#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:31,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {16754#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16755#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:31,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {16755#(<= 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; {16755#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:31,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {16755#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16756#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:31,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {16756#(<= 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; {16756#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:31,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {16756#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16757#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:31,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {16757#(<= 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; {16757#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:31,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {16757#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16758#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:31,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {16758#(<= 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; {16758#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:31,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {16758#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16759#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:31,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {16759#(<= 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; {16759#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:31,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {16759#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16760#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {16760#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {16735#false} ~i~0 := 0; {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 68: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 69: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 70: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 73: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 74: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 75: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 76: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 79: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 90: Hoare triple {16735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 91: Hoare triple {16735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 92: Hoare triple {16735#false} assume !(~i~0 < 2048); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 93: Hoare triple {16735#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); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L272 TraceCheckUtils]: 94: Hoare triple {16735#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {16735#false} ~cond := #in~cond; {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {16735#false} assume 0 == ~cond; {16735#false} is VALID [2022-04-15 12:17:31,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {16735#false} assume !false; {16735#false} is VALID [2022-04-15 12:17:31,372 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-15 12:17:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:31,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3689964] [2022-04-15 12:17:31,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3689964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:31,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285645489] [2022-04-15 12:17:31,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:31,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:31,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:31,374 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:31,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:19:03,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 12:19:03,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:03,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:19:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:03,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:04,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {16734#true} call ULTIMATE.init(); {16734#true} is VALID [2022-04-15 12:19:04,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {16734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16734#true} is VALID [2022-04-15 12:19:04,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {16734#true} assume true; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16734#true} {16734#true} #58#return; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {16734#true} call #t~ret8 := main(); {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {16734#true} assume !(~i~0 < 2048); {16734#true} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {16734#true} ~i~0 := 0; {16912#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:04,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {16912#(<= 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); {16912#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:04,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {16912#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16740#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:04,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {16740#(<= 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); {16740#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:04,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {16740#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16741#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:04,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {16741#(<= 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); {16741#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:04,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {16741#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16742#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:04,021 INFO L290 TraceCheckUtils]: 56: Hoare triple {16742#(<= 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); {16742#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:04,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {16742#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16743#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:04,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {16743#(<= 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); {16743#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:04,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {16743#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16744#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:04,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {16744#(<= 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); {16744#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:04,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {16744#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16745#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:04,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {16745#(<= 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); {16745#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:04,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {16745#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16746#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:04,024 INFO L290 TraceCheckUtils]: 64: Hoare triple {16746#(<= 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); {16746#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:04,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {16746#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16747#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:04,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {16747#(<= 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); {16747#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:04,025 INFO L290 TraceCheckUtils]: 67: Hoare triple {16747#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16748#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:04,025 INFO L290 TraceCheckUtils]: 68: Hoare triple {16748#(<= 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); {16748#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:04,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {16748#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16749#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:04,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {16749#(<= 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); {16749#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:04,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {16749#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16750#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:04,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {16750#(<= 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); {16750#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:04,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {16750#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16751#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:04,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {16751#(<= 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); {16751#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:04,027 INFO L290 TraceCheckUtils]: 75: Hoare triple {16751#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16752#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:04,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {16752#(<= 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); {16752#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:04,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {16752#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16753#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:04,028 INFO L290 TraceCheckUtils]: 78: Hoare triple {16753#(<= 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); {16753#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:04,028 INFO L290 TraceCheckUtils]: 79: Hoare triple {16753#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16754#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:04,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {16754#(<= 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); {16754#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:04,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {16754#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16755#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:04,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {16755#(<= 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); {16755#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:04,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {16755#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16756#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:04,030 INFO L290 TraceCheckUtils]: 84: Hoare triple {16756#(<= 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); {16756#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:04,030 INFO L290 TraceCheckUtils]: 85: Hoare triple {16756#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16757#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:04,030 INFO L290 TraceCheckUtils]: 86: Hoare triple {16757#(<= 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); {16757#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:04,031 INFO L290 TraceCheckUtils]: 87: Hoare triple {16757#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16758#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:04,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {16758#(<= 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); {16758#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:04,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {16758#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16759#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:04,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {16759#(<= 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); {16759#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 91: Hoare triple {16759#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16760#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 92: Hoare triple {16760#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16735#false} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 93: Hoare triple {16735#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); {16735#false} is VALID [2022-04-15 12:19:04,032 INFO L272 TraceCheckUtils]: 94: Hoare triple {16735#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16735#false} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 95: Hoare triple {16735#false} ~cond := #in~cond; {16735#false} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 96: Hoare triple {16735#false} assume 0 == ~cond; {16735#false} is VALID [2022-04-15 12:19:04,032 INFO L290 TraceCheckUtils]: 97: Hoare triple {16735#false} assume !false; {16735#false} is VALID [2022-04-15 12:19:04,033 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-15 12:19:04,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:04,831 INFO L290 TraceCheckUtils]: 97: Hoare triple {16735#false} assume !false; {16735#false} is VALID [2022-04-15 12:19:04,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {16735#false} assume 0 == ~cond; {16735#false} is VALID [2022-04-15 12:19:04,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {16735#false} ~cond := #in~cond; {16735#false} is VALID [2022-04-15 12:19:04,831 INFO L272 TraceCheckUtils]: 94: Hoare triple {16735#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16735#false} is VALID [2022-04-15 12:19:04,831 INFO L290 TraceCheckUtils]: 93: Hoare triple {16735#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); {16735#false} is VALID [2022-04-15 12:19:04,832 INFO L290 TraceCheckUtils]: 92: Hoare triple {17072#(< main_~i~0 2048)} assume !(~i~0 < 2048); {16735#false} is VALID [2022-04-15 12:19:04,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {17076#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17072#(< main_~i~0 2048)} is VALID [2022-04-15 12:19:04,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {17076#(< 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); {17076#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:04,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {17083#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17076#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:04,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {17083#(< 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); {17083#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:04,834 INFO L290 TraceCheckUtils]: 87: Hoare triple {17090#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17083#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:04,834 INFO L290 TraceCheckUtils]: 86: Hoare triple {17090#(< 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); {17090#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:04,834 INFO L290 TraceCheckUtils]: 85: Hoare triple {17097#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17090#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:04,835 INFO L290 TraceCheckUtils]: 84: Hoare triple {17097#(< 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); {17097#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:04,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {17104#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17097#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:04,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {17104#(< 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); {17104#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:04,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {17111#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17104#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:04,836 INFO L290 TraceCheckUtils]: 80: Hoare triple {17111#(< 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); {17111#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:04,836 INFO L290 TraceCheckUtils]: 79: Hoare triple {17118#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17111#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:04,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {17118#(< 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); {17118#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:04,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {17125#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17118#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:04,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {17125#(< 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); {17125#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:04,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {17132#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17125#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:04,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {17132#(< 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); {17132#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:04,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {17139#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17132#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:04,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {17139#(< 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); {17139#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:04,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {17146#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17139#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:04,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {17146#(< 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); {17146#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:04,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {17153#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17146#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:04,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {17153#(< 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); {17153#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:04,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {17160#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17153#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:04,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {17160#(< 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); {17160#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:04,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {17167#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17160#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:04,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {17167#(< 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); {17167#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:04,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {17174#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17167#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:04,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {17174#(< 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); {17174#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:04,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {17181#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17174#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:04,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {17181#(< 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); {17181#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:04,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {17188#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17181#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:04,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {17188#(< 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); {17188#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:04,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {17195#(< main_~i~0 2030)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17188#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:04,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {17195#(< 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); {17195#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:04,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {17202#(< main_~i~0 2029)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17195#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:04,845 INFO L290 TraceCheckUtils]: 54: Hoare triple {17202#(< 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); {17202#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:04,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {17209#(< main_~i~0 2028)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17202#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:04,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {17209#(< 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); {17209#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:04,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {17216#(< main_~i~0 2027)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17209#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:04,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {17216#(< 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); {17216#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:04,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {16734#true} ~i~0 := 0; {17216#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:04,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {16734#true} assume !(~i~0 < 2048); {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {16734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16734#true} is VALID [2022-04-15 12:19:04,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {16734#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; {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {16734#true} call #t~ret8 := main(); {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16734#true} {16734#true} #58#return; {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {16734#true} assume true; {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {16734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16734#true} is VALID [2022-04-15 12:19:04,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {16734#true} call ULTIMATE.init(); {16734#true} is VALID [2022-04-15 12:19:04,851 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-15 12:19:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285645489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:04,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:04,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 12:19:04,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [862619170] [2022-04-15 12:19:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [862619170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:19:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457391328] [2022-04-15 12:19:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:04,852 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-15 12:19:04,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:04,852 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-15 12:19:04,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:04,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:19:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:19:04,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:19:04,894 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-15 12:19:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,913 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2022-04-15 12:19:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:19:05,913 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-15 12:19:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:05,914 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-15 12:19:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-15 12:19:05,915 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-15 12:19:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-15 12:19:05,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 117 transitions. [2022-04-15 12:19:06,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:06,056 INFO L225 Difference]: With dead ends: 155 [2022-04-15 12:19:06,056 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 12:19:06,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:19:06,057 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 129 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:06,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 36 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 12:19:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2022-04-15 12:19:06,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:06,335 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-15 12:19:06,335 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-15 12:19:06,335 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-15 12:19:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:06,336 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-15 12:19:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 12:19:06,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:06,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:06,337 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-15 12:19:06,337 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-15 12:19:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:06,338 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-15 12:19:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 12:19:06,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:06,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:06,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:06,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:06,338 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-15 12:19:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-15 12:19:06,356 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2022-04-15 12:19:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:06,356 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-15 12:19:06,356 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-15 12:19:06,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-15 12:19:06,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-15 12:19:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 12:19:06,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:06,506 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-15 12:19:06,577 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-15 12:19:06,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 12:19:06,719 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 43 times [2022-04-15 12:19:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775844751] [2022-04-15 12:19:06,727 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:06,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 44 times [2022-04-15 12:19:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:06,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788412063] [2022-04-15 12:19:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {18170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {18142#true} assume true; {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18142#true} {18142#true} #58#return; {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {18142#true} call ULTIMATE.init(); {18170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:07,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {18170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {18142#true} assume true; {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18142#true} {18142#true} #58#return; {18142#true} is VALID [2022-04-15 12:19:07,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {18142#true} call #t~ret8 := main(); {18142#true} is VALID [2022-04-15 12:19:07,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {18142#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; {18147#(= main_~i~0 0)} is VALID [2022-04-15 12:19:07,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {18147#(= 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; {18147#(= main_~i~0 0)} is VALID [2022-04-15 12:19:07,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {18147#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18148#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {18148#(<= 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; {18148#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {18148#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {18149#(<= 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; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {18150#(<= 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; {18150#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {18150#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {18151#(<= 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; {18151#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {18151#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {18152#(<= 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; {18152#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {18152#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {18153#(<= 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; {18153#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {18153#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {18154#(<= 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; {18154#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {18154#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {18155#(<= 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; {18155#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {18155#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {18156#(<= 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; {18156#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {18156#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {18157#(<= 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; {18157#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {18157#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {18158#(<= 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; {18158#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {18158#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {18159#(<= 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; {18159#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {18159#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {18160#(<= 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; {18160#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {18160#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {18161#(<= 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; {18161#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {18161#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {18162#(<= 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; {18162#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {18162#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {18163#(<= 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; {18163#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {18163#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {18164#(<= 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; {18164#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {18164#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {18165#(<= 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; {18165#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {18165#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {18166#(<= 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; {18166#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {18166#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {18167#(<= 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; {18167#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {18167#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {18168#(<= 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; {18168#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {18168#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {18169#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {18143#false} ~i~0 := 0; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 75: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 81: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 82: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 84: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 85: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 86: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 87: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 88: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 89: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 90: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,151 INFO L290 TraceCheckUtils]: 91: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,152 INFO L290 TraceCheckUtils]: 92: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,152 INFO L290 TraceCheckUtils]: 93: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,152 INFO L290 TraceCheckUtils]: 94: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,152 INFO L290 TraceCheckUtils]: 95: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,152 INFO L290 TraceCheckUtils]: 96: Hoare triple {18143#false} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:07,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {18143#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); {18143#false} is VALID [2022-04-15 12:19:07,167 INFO L272 TraceCheckUtils]: 98: Hoare triple {18143#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {18143#false} is VALID [2022-04-15 12:19:07,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {18143#false} ~cond := #in~cond; {18143#false} is VALID [2022-04-15 12:19:07,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {18143#false} assume 0 == ~cond; {18143#false} is VALID [2022-04-15 12:19:07,167 INFO L290 TraceCheckUtils]: 101: Hoare triple {18143#false} assume !false; {18143#false} is VALID [2022-04-15 12:19:07,173 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-15 12:19:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:07,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788412063] [2022-04-15 12:19:07,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788412063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:07,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304226141] [2022-04-15 12:19:07,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:07,174 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:07,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:19:07,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:07,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:07,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:19:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:07,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {18142#true} call ULTIMATE.init(); {18142#true} is VALID [2022-04-15 12:19:07,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {18142#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18142#true} is VALID [2022-04-15 12:19:07,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {18142#true} assume true; {18142#true} is VALID [2022-04-15 12:19:07,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18142#true} {18142#true} #58#return; {18142#true} is VALID [2022-04-15 12:19:07,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {18142#true} call #t~ret8 := main(); {18142#true} is VALID [2022-04-15 12:19:07,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {18142#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; {18189#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:07,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {18189#(<= 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; {18189#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:07,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {18189#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18148#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {18148#(<= 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; {18148#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {18148#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {18149#(<= 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; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {18150#(<= 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; {18150#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {18150#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {18151#(<= 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; {18151#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {18151#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {18152#(<= 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; {18152#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {18152#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {18153#(<= 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; {18153#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {18153#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {18154#(<= 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; {18154#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {18154#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {18155#(<= 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; {18155#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {18155#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {18156#(<= 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; {18156#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {18156#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {18157#(<= 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; {18157#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {18157#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {18158#(<= 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; {18158#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {18158#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {18159#(<= 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; {18159#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {18159#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {18160#(<= 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; {18160#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {18160#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {18161#(<= 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; {18161#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {18161#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {18162#(<= 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; {18162#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {18162#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {18163#(<= 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; {18163#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {18163#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {18164#(<= 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; {18164#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {18164#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {18165#(<= 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; {18165#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {18165#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {18166#(<= 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; {18166#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {18166#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {18167#(<= 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; {18167#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {18167#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {18168#(<= 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; {18168#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {18168#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {18169#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {18143#false} ~i~0 := 0; {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 76: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 77: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 80: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 81: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 82: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 83: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,977 INFO L290 TraceCheckUtils]: 90: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,977 INFO L290 TraceCheckUtils]: 91: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,991 INFO L290 TraceCheckUtils]: 94: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:07,991 INFO L290 TraceCheckUtils]: 95: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:07,991 INFO L290 TraceCheckUtils]: 96: Hoare triple {18143#false} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:07,991 INFO L290 TraceCheckUtils]: 97: Hoare triple {18143#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); {18143#false} is VALID [2022-04-15 12:19:07,992 INFO L272 TraceCheckUtils]: 98: Hoare triple {18143#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {18143#false} is VALID [2022-04-15 12:19:07,992 INFO L290 TraceCheckUtils]: 99: Hoare triple {18143#false} ~cond := #in~cond; {18143#false} is VALID [2022-04-15 12:19:07,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {18143#false} assume 0 == ~cond; {18143#false} is VALID [2022-04-15 12:19:07,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {18143#false} assume !false; {18143#false} is VALID [2022-04-15 12:19:07,992 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-15 12:19:07,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:08,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {18143#false} assume !false; {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 100: Hoare triple {18143#false} assume 0 == ~cond; {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 99: Hoare triple {18143#false} ~cond := #in~cond; {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L272 TraceCheckUtils]: 98: Hoare triple {18143#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 97: Hoare triple {18143#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); {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {18143#false} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 95: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 91: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 90: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 87: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 86: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 85: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 84: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 83: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 82: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 81: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 79: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {18143#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {18143#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18143#false} is VALID [2022-04-15 12:19:08,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {18143#false} ~i~0 := 0; {18143#false} is VALID [2022-04-15 12:19:08,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {18631#(< main_~i~0 2048)} assume !(~i~0 < 2048); {18143#false} is VALID [2022-04-15 12:19:08,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {18635#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18631#(< main_~i~0 2048)} is VALID [2022-04-15 12:19:08,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {18635#(< 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; {18635#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:08,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {18642#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18635#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:08,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {18642#(< 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; {18642#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:08,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {18649#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18642#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:08,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {18649#(< 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; {18649#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:08,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {18656#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18649#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:08,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {18656#(< 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; {18656#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:08,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {18663#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18656#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:08,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {18663#(< 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; {18663#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:08,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {18670#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18663#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:08,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {18670#(< 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; {18670#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:08,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {18677#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18670#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:08,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {18677#(< 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; {18677#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:08,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {18684#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18677#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:08,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {18684#(< 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; {18684#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:08,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {18691#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18684#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:08,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {18691#(< 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; {18691#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:08,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {18698#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18691#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:08,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {18698#(< 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; {18698#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:08,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {18705#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18698#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:08,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {18705#(< 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; {18705#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:08,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {18712#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18705#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:08,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {18712#(< 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; {18712#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:08,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {18719#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18712#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:08,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {18719#(< 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; {18719#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:08,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {18726#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18719#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:08,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {18726#(< 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; {18726#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:08,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {18733#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18726#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:08,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {18733#(< 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; {18733#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:08,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {18740#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18733#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:08,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {18740#(< 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; {18740#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:08,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {18747#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18740#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:08,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {18747#(< 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; {18747#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:08,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {18754#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18747#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:08,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {18754#(< 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; {18754#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:08,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {18761#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18754#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:08,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {18761#(< 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; {18761#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:08,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {18768#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18761#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:08,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {18768#(< 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; {18768#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:08,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {18775#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18768#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:08,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {18775#(< 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; {18775#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:08,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {18782#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18775#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:08,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {18782#(< 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; {18782#(< main_~i~0 2026)} is VALID [2022-04-15 12:19:08,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {18142#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; {18782#(< main_~i~0 2026)} is VALID [2022-04-15 12:19:08,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {18142#true} call #t~ret8 := main(); {18142#true} is VALID [2022-04-15 12:19:08,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18142#true} {18142#true} #58#return; {18142#true} is VALID [2022-04-15 12:19:08,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {18142#true} assume true; {18142#true} is VALID [2022-04-15 12:19:08,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {18142#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18142#true} is VALID [2022-04-15 12:19:08,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {18142#true} call ULTIMATE.init(); {18142#true} is VALID [2022-04-15 12:19:08,979 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-15 12:19:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304226141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:08,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:08,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 12:19:08,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:08,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775844751] [2022-04-15 12:19:08,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775844751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:08,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:08,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:19:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090664813] [2022-04-15 12:19:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:08,981 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-15 12:19:08,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:08,981 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-15 12:19:09,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:09,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:19:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:19:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:19:09,023 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-15 12:19:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:09,971 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2022-04-15 12:19:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:19:09,972 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-15 12:19:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:09,972 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-15 12:19:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-15 12:19:09,973 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-15 12:19:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-15 12:19:09,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 121 transitions. [2022-04-15 12:19:10,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:10,146 INFO L225 Difference]: With dead ends: 161 [2022-04-15 12:19:10,146 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 12:19:10,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:19:10,148 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:10,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 36 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 12:19:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-04-15 12:19:10,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:10,351 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-15 12:19:10,351 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-15 12:19:10,352 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-15 12:19:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:10,353 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 12:19:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:19:10,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:10,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:10,353 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-15 12:19:10,353 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-15 12:19:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:10,354 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 12:19:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:19:10,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:10,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:10,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:10,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:10,355 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-15 12:19:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 12:19:10,356 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2022-04-15 12:19:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:10,356 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 12:19:10,356 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-15 12:19:10,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 12:19:10,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 12:19:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 12:19:10,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:10,451 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-15 12:19:10,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:10,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:10,652 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 45 times [2022-04-15 12:19:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:10,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99566426] [2022-04-15 12:19:10,658 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:10,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 46 times [2022-04-15 12:19:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101509029] [2022-04-15 12:19:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {19635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {19606#true} assume true; {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19606#true} {19606#true} #58#return; {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {19606#true} call ULTIMATE.init(); {19635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:10,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {19635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {19606#true} assume true; {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19606#true} {19606#true} #58#return; {19606#true} is VALID [2022-04-15 12:19:10,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {19606#true} call #t~ret8 := main(); {19606#true} is VALID [2022-04-15 12:19:11,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {19606#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; {19611#(= main_~i~0 0)} is VALID [2022-04-15 12:19:11,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {19611#(= 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; {19611#(= main_~i~0 0)} is VALID [2022-04-15 12:19:11,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {19611#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19612#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {19612#(<= 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; {19612#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {19612#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {19613#(<= 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; {19613#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {19613#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {19614#(<= 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; {19614#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {19614#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {19615#(<= 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; {19615#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {19615#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {19616#(<= 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; {19616#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {19616#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {19617#(<= 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; {19617#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {19617#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {19618#(<= 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; {19618#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {19618#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {19619#(<= 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; {19619#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {19619#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {19620#(<= 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; {19620#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {19620#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {19621#(<= 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; {19621#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {19621#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {19622#(<= 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; {19622#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {19622#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {19623#(<= 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; {19623#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {19623#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {19624#(<= 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; {19624#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {19624#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {19625#(<= 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; {19625#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {19625#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {19626#(<= 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; {19626#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {19626#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {19627#(<= 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; {19627#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {19627#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {19628#(<= 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; {19628#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {19628#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {19629#(<= 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; {19629#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {19629#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {19630#(<= 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; {19630#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {19630#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {19631#(<= 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; {19631#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {19631#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {19632#(<= 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; {19632#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {19632#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {19633#(<= 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; {19633#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {19633#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {19634#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {19607#false} ~i~0 := 0; {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 58: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 67: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 68: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 71: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 83: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 87: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 88: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 90: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 91: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 92: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 96: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 97: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 98: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 99: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {19607#false} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {19607#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); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L272 TraceCheckUtils]: 102: Hoare triple {19607#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 103: Hoare triple {19607#false} ~cond := #in~cond; {19607#false} is VALID [2022-04-15 12:19:11,027 INFO L290 TraceCheckUtils]: 104: Hoare triple {19607#false} assume 0 == ~cond; {19607#false} is VALID [2022-04-15 12:19:11,028 INFO L290 TraceCheckUtils]: 105: Hoare triple {19607#false} assume !false; {19607#false} is VALID [2022-04-15 12:19:11,028 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-15 12:19:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101509029] [2022-04-15 12:19:11,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101509029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635036387] [2022-04-15 12:19:11,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:11,030 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:19:11,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:11,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:11,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:19:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:11,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:11,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {19606#true} call ULTIMATE.init(); {19606#true} is VALID [2022-04-15 12:19:11,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {19606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19606#true} is VALID [2022-04-15 12:19:11,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {19606#true} assume true; {19606#true} is VALID [2022-04-15 12:19:11,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19606#true} {19606#true} #58#return; {19606#true} is VALID [2022-04-15 12:19:11,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {19606#true} call #t~ret8 := main(); {19606#true} is VALID [2022-04-15 12:19:11,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {19606#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; {19654#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:11,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {19654#(<= 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; {19654#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:11,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {19654#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19612#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {19612#(<= 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; {19612#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {19612#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {19613#(<= 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; {19613#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {19613#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {19614#(<= 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; {19614#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {19614#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {19615#(<= 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; {19615#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {19615#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {19616#(<= 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; {19616#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {19616#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {19617#(<= 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; {19617#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {19617#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {19618#(<= 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; {19618#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {19618#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {19619#(<= 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; {19619#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {19619#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {19620#(<= 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; {19620#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {19620#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {19621#(<= 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; {19621#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {19621#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {19622#(<= 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; {19622#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {19622#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {19623#(<= 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; {19623#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {19623#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {19624#(<= 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; {19624#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {19624#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {19625#(<= 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; {19625#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {19625#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {19626#(<= 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; {19626#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {19626#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {19627#(<= 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; {19627#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {19627#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {19628#(<= 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; {19628#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {19628#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {19629#(<= 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; {19629#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {19629#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {19630#(<= 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; {19630#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {19630#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {19631#(<= 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; {19631#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {19631#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {19632#(<= 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; {19632#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {19632#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {19633#(<= 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; {19633#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {19633#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {19634#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {19607#false} ~i~0 := 0; {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 76: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 80: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 81: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 82: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 83: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 86: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 87: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 89: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 90: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 91: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 95: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 97: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 98: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 99: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 100: Hoare triple {19607#false} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 101: Hoare triple {19607#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); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L272 TraceCheckUtils]: 102: Hoare triple {19607#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 103: Hoare triple {19607#false} ~cond := #in~cond; {19607#false} is VALID [2022-04-15 12:19:11,695 INFO L290 TraceCheckUtils]: 104: Hoare triple {19607#false} assume 0 == ~cond; {19607#false} is VALID [2022-04-15 12:19:11,696 INFO L290 TraceCheckUtils]: 105: Hoare triple {19607#false} assume !false; {19607#false} is VALID [2022-04-15 12:19:11,696 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-15 12:19:11,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:12,554 INFO L290 TraceCheckUtils]: 105: Hoare triple {19607#false} assume !false; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 104: Hoare triple {19607#false} assume 0 == ~cond; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 103: Hoare triple {19607#false} ~cond := #in~cond; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L272 TraceCheckUtils]: 102: Hoare triple {19607#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 101: Hoare triple {19607#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); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 100: Hoare triple {19607#false} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 99: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 98: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 97: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 96: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 95: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 94: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 92: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 91: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 90: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 89: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 88: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 87: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 86: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 85: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 81: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 80: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,556 INFO L290 TraceCheckUtils]: 79: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 76: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 75: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 70: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {19607#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {19607#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19607#false} is VALID [2022-04-15 12:19:12,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {19607#false} ~i~0 := 0; {19607#false} is VALID [2022-04-15 12:19:12,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {20114#(< main_~i~0 2048)} assume !(~i~0 < 2048); {19607#false} is VALID [2022-04-15 12:19:12,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {20118#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20114#(< main_~i~0 2048)} is VALID [2022-04-15 12:19:12,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {20118#(< 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; {20118#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:12,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {20125#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20118#(< main_~i~0 2047)} is VALID [2022-04-15 12:19:12,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {20125#(< 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; {20125#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:12,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {20132#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20125#(< main_~i~0 2046)} is VALID [2022-04-15 12:19:12,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {20132#(< 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; {20132#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:12,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {20139#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#(< main_~i~0 2045)} is VALID [2022-04-15 12:19:12,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {20139#(< 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; {20139#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:12,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {20146#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20139#(< main_~i~0 2044)} is VALID [2022-04-15 12:19:12,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {20146#(< 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; {20146#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:12,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20146#(< main_~i~0 2043)} is VALID [2022-04-15 12:19:12,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#(< 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; {20153#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:12,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {20160#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#(< main_~i~0 2042)} is VALID [2022-04-15 12:19:12,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {20160#(< 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; {20160#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:12,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {20167#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20160#(< main_~i~0 2041)} is VALID [2022-04-15 12:19:12,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {20167#(< 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; {20167#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:12,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {20174#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20167#(< main_~i~0 2040)} is VALID [2022-04-15 12:19:12,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {20174#(< 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; {20174#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:12,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {20181#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20174#(< main_~i~0 2039)} is VALID [2022-04-15 12:19:12,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {20181#(< 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; {20181#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:12,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {20188#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20181#(< main_~i~0 2038)} is VALID [2022-04-15 12:19:12,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {20188#(< 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; {20188#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:12,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {20195#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20188#(< main_~i~0 2037)} is VALID [2022-04-15 12:19:12,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {20195#(< 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; {20195#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:12,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {20202#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20195#(< main_~i~0 2036)} is VALID [2022-04-15 12:19:12,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {20202#(< 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; {20202#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:12,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {20209#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20202#(< main_~i~0 2035)} is VALID [2022-04-15 12:19:12,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {20209#(< 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; {20209#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:12,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {20216#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20209#(< main_~i~0 2034)} is VALID [2022-04-15 12:19:12,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {20216#(< 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; {20216#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:12,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {20223#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20216#(< main_~i~0 2033)} is VALID [2022-04-15 12:19:12,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {20223#(< 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; {20223#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:12,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {20230#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20223#(< main_~i~0 2032)} is VALID [2022-04-15 12:19:12,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {20230#(< 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; {20230#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:12,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {20237#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20230#(< main_~i~0 2031)} is VALID [2022-04-15 12:19:12,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {20237#(< 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; {20237#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:12,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {20244#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20237#(< main_~i~0 2030)} is VALID [2022-04-15 12:19:12,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {20244#(< 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; {20244#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:12,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {20251#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20244#(< main_~i~0 2029)} is VALID [2022-04-15 12:19:12,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {20251#(< 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; {20251#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:12,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {20258#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20251#(< main_~i~0 2028)} is VALID [2022-04-15 12:19:12,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {20258#(< 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; {20258#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:12,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {20265#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20258#(< main_~i~0 2027)} is VALID [2022-04-15 12:19:12,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {20265#(< 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; {20265#(< main_~i~0 2026)} is VALID [2022-04-15 12:19:12,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {20272#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20265#(< main_~i~0 2026)} is VALID [2022-04-15 12:19:12,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {20272#(< 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; {20272#(< main_~i~0 2025)} is VALID [2022-04-15 12:19:12,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {19606#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; {20272#(< main_~i~0 2025)} is VALID [2022-04-15 12:19:12,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {19606#true} call #t~ret8 := main(); {19606#true} is VALID [2022-04-15 12:19:12,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19606#true} {19606#true} #58#return; {19606#true} is VALID [2022-04-15 12:19:12,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {19606#true} assume true; {19606#true} is VALID [2022-04-15 12:19:12,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {19606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {19606#true} is VALID [2022-04-15 12:19:12,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {19606#true} call ULTIMATE.init(); {19606#true} is VALID [2022-04-15 12:19:12,576 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-15 12:19:12,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635036387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:12,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:12,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 12:19:12,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99566426] [2022-04-15 12:19:12,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99566426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:12,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:12,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:19:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785169012] [2022-04-15 12:19:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:12,578 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-15 12:19:12,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:12,578 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-15 12:19:12,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:12,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:19:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:19:12,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:19:12,629 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-15 12:19:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,576 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2022-04-15 12:19:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:19:13,576 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-15 12:19:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:13,577 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-15 12:19:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-15 12:19:13,579 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-15 12:19:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-15 12:19:13,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 125 transitions. [2022-04-15 12:19:13,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:13,685 INFO L225 Difference]: With dead ends: 167 [2022-04-15 12:19:13,685 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 12:19:13,686 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-15 12:19:13,686 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 150 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:13,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 36 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 12:19:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-15 12:19:13,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:13,945 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-15 12:19:13,945 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-15 12:19:13,945 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-15 12:19:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,947 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 12:19:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 12:19:13,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:13,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:13,947 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-15 12:19:13,947 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-15 12:19:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,949 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 12:19:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 12:19:13,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:13,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:13,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:13,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:13,949 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-15 12:19:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-15 12:19:13,952 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-04-15 12:19:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:13,952 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-15 12:19:13,952 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-15 12:19:13,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-15 12:19:14,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-15 12:19:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 12:19:14,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:14,054 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-15 12:19:14,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:19:14,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:14,255 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 47 times [2022-04-15 12:19:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:14,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884529223] [2022-04-15 12:19:14,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:14,263 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 48 times [2022-04-15 12:19:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702430810] [2022-04-15 12:19:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:14,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {21156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21126#true} is VALID [2022-04-15 12:19:14,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {21126#true} assume true; {21126#true} is VALID [2022-04-15 12:19:14,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21126#true} {21126#true} #58#return; {21126#true} is VALID [2022-04-15 12:19:14,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {21126#true} call ULTIMATE.init(); {21156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:14,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {21156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21126#true} is VALID [2022-04-15 12:19:14,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {21126#true} assume true; {21126#true} is VALID [2022-04-15 12:19:14,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21126#true} {21126#true} #58#return; {21126#true} is VALID [2022-04-15 12:19:14,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {21126#true} call #t~ret8 := main(); {21126#true} is VALID [2022-04-15 12:19:14,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {21126#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; {21131#(= main_~i~0 0)} is VALID [2022-04-15 12:19:14,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {21131#(= 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; {21131#(= main_~i~0 0)} is VALID [2022-04-15 12:19:14,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {21131#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21132#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:14,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {21132#(<= 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; {21132#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:14,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {21132#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:14,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {21133#(<= 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; {21133#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:14,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {21133#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:14,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {21134#(<= 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; {21134#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:14,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {21134#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:14,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {21135#(<= 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; {21135#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:14,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {21135#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:14,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {21136#(<= 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; {21136#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:14,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {21136#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:14,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {21137#(<= 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; {21137#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:14,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {21137#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:14,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {21138#(<= 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; {21138#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:14,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {21138#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:14,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#(<= 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; {21139#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:14,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:14,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {21140#(<= 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; {21140#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:14,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {21140#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:14,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {21141#(<= 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; {21141#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:14,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {21141#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:14,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {21142#(<= 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; {21142#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:14,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {21142#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:14,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {21143#(<= 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; {21143#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:14,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {21143#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:14,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {21144#(<= 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; {21144#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:14,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {21144#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:14,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {21145#(<= 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; {21145#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:14,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {21145#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:14,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {21146#(<= 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; {21146#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:14,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {21146#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:14,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {21147#(<= 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; {21147#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:14,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {21147#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:14,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {21148#(<= 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; {21148#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:14,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {21148#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:14,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {21149#(<= 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; {21149#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:14,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {21149#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:14,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {21150#(<= 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; {21150#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:14,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {21150#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:14,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {21151#(<= 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; {21151#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:14,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {21151#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:14,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {21152#(<= 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; {21152#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:14,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {21152#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:14,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {21153#(<= 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; {21153#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:14,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {21153#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:14,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {21154#(<= 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; {21154#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:14,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {21154#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {21155#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {21127#false} ~i~0 := 0; {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,650 INFO L290 TraceCheckUtils]: 79: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,651 INFO L290 TraceCheckUtils]: 94: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 95: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 96: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 97: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 98: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 99: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 101: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 102: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 103: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 104: Hoare triple {21127#false} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {21127#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); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L272 TraceCheckUtils]: 106: Hoare triple {21127#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 107: Hoare triple {21127#false} ~cond := #in~cond; {21127#false} is VALID [2022-04-15 12:19:14,652 INFO L290 TraceCheckUtils]: 108: Hoare triple {21127#false} assume 0 == ~cond; {21127#false} is VALID [2022-04-15 12:19:14,653 INFO L290 TraceCheckUtils]: 109: Hoare triple {21127#false} assume !false; {21127#false} is VALID [2022-04-15 12:19:14,653 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-15 12:19:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:14,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702430810] [2022-04-15 12:19:14,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702430810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:14,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628653322] [2022-04-15 12:19:14,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:14,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:14,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:14,655 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:14,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:22:30,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 12:22:30,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:30,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:22:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:31,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:31,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {21126#true} call ULTIMATE.init(); {21126#true} is VALID [2022-04-15 12:22:31,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {21126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21126#true} is VALID [2022-04-15 12:22:31,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {21126#true} assume true; {21126#true} is VALID [2022-04-15 12:22:31,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21126#true} {21126#true} #58#return; {21126#true} is VALID [2022-04-15 12:22:31,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {21126#true} call #t~ret8 := main(); {21126#true} is VALID [2022-04-15 12:22:31,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {21126#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; {21175#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:31,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {21175#(<= 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; {21175#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:31,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {21175#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21132#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:31,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {21132#(<= 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; {21132#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:31,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {21132#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:31,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {21133#(<= 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; {21133#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:31,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {21133#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:31,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {21134#(<= 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; {21134#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:31,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {21134#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:31,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {21135#(<= 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; {21135#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:31,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {21135#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:31,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {21136#(<= 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; {21136#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:31,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {21136#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:31,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {21137#(<= 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; {21137#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:31,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {21137#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:31,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {21138#(<= 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; {21138#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:31,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {21138#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:31,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#(<= 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; {21139#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:31,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:31,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {21140#(<= 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; {21140#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:31,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {21140#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:31,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {21141#(<= 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; {21141#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:31,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {21141#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:31,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {21142#(<= 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; {21142#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:31,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {21142#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:31,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {21143#(<= 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; {21143#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:31,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {21143#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:31,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {21144#(<= 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; {21144#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:31,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {21144#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:31,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {21145#(<= 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; {21145#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:31,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {21145#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:31,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {21146#(<= 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; {21146#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:31,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {21146#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:31,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {21147#(<= 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; {21147#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:31,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {21147#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:31,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {21148#(<= 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; {21148#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:31,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {21148#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:31,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {21149#(<= 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; {21149#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:31,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {21149#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:31,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {21150#(<= 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; {21150#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:31,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {21150#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:31,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {21151#(<= 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; {21151#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:31,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {21151#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:31,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {21152#(<= 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; {21152#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:31,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {21152#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:31,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {21153#(<= 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; {21153#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:31,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {21153#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:31,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {21154#(<= 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; {21154#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:31,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {21154#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {21155#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {21127#false} ~i~0 := 0; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 61: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 82: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 83: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 91: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 92: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 93: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 94: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,369 INFO L290 TraceCheckUtils]: 95: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 96: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 97: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 98: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 101: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 102: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 103: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 104: Hoare triple {21127#false} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 105: Hoare triple {21127#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); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L272 TraceCheckUtils]: 106: Hoare triple {21127#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 107: Hoare triple {21127#false} ~cond := #in~cond; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 108: Hoare triple {21127#false} assume 0 == ~cond; {21127#false} is VALID [2022-04-15 12:22:31,370 INFO L290 TraceCheckUtils]: 109: Hoare triple {21127#false} assume !false; {21127#false} is VALID [2022-04-15 12:22:31,371 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-15 12:22:31,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:32,294 INFO L290 TraceCheckUtils]: 109: Hoare triple {21127#false} assume !false; {21127#false} is VALID [2022-04-15 12:22:32,294 INFO L290 TraceCheckUtils]: 108: Hoare triple {21127#false} assume 0 == ~cond; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 107: Hoare triple {21127#false} ~cond := #in~cond; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L272 TraceCheckUtils]: 106: Hoare triple {21127#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 105: Hoare triple {21127#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); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 104: Hoare triple {21127#false} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 103: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 102: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 101: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 100: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 99: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 98: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 97: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 96: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 91: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 88: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 87: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 86: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 85: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 84: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 82: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 81: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 71: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 68: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 67: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {21127#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {21127#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21127#false} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {21127#false} ~i~0 := 0; {21127#false} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {21653#(< main_~i~0 2048)} assume !(~i~0 < 2048); {21127#false} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {21657#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21653#(< main_~i~0 2048)} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {21657#(< 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; {21657#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {21664#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21657#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {21664#(< 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; {21664#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {21671#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21664#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {21671#(< 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; {21671#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {21678#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21671#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {21678#(< 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; {21678#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {21685#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21678#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {21685#(< 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; {21685#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {21692#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21685#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {21692#(< 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; {21692#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {21699#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21692#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {21699#(< 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; {21699#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {21706#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21699#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {21706#(< 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; {21706#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {21713#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21706#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {21713#(< 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; {21713#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {21720#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21713#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {21720#(< 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; {21720#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {21727#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21720#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {21727#(< 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; {21727#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {21734#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21727#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {21734#(< 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; {21734#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {21741#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21734#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {21741#(< 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; {21741#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {21748#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21741#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {21748#(< 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; {21748#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {21755#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21748#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {21755#(< 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; {21755#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {21762#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21755#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {21762#(< 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; {21762#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {21769#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21762#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {21769#(< 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; {21769#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {21776#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21769#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {21776#(< 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; {21776#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {21783#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21776#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {21783#(< 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; {21783#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {21790#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21783#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {21790#(< 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; {21790#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {21797#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21790#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {21797#(< 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; {21797#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {21804#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21797#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {21804#(< 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; {21804#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {21811#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21804#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {21811#(< 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; {21811#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {21818#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21811#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {21818#(< 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; {21818#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {21126#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; {21818#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:32,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {21126#true} call #t~ret8 := main(); {21126#true} is VALID [2022-04-15 12:22:32,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21126#true} {21126#true} #58#return; {21126#true} is VALID [2022-04-15 12:22:32,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {21126#true} assume true; {21126#true} is VALID [2022-04-15 12:22:32,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {21126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21126#true} is VALID [2022-04-15 12:22:32,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {21126#true} call ULTIMATE.init(); {21126#true} is VALID [2022-04-15 12:22:32,314 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-15 12:22:32,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628653322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:32,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:32,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 12:22:32,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:32,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884529223] [2022-04-15 12:22:32,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884529223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:32,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:32,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:22:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714145770] [2022-04-15 12:22:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:32,316 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-15 12:22:32,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:32,316 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-15 12:22:32,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:32,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:22:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:32,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:22:32,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:22:32,357 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-15 12:22:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:33,262 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-15 12:22:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:22:33,262 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-15 12:22:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:33,262 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-15 12:22:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-15 12:22:33,263 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-15 12:22:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-15 12:22:33,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 129 transitions. [2022-04-15 12:22:33,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:33,366 INFO L225 Difference]: With dead ends: 173 [2022-04-15 12:22:33,366 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 12:22:33,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:22:33,367 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 163 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:33,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 26 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:22:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 12:22:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-04-15 12:22:33,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:33,650 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-15 12:22:33,650 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-15 12:22:33,650 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-15 12:22:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:33,652 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-15 12:22:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 12:22:33,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:33,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:33,652 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-15 12:22:33,652 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-15 12:22:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:33,653 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-15 12:22:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 12:22:33,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:33,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:33,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:33,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:33,654 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-15 12:22:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-15 12:22:33,655 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-04-15 12:22:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:33,655 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-15 12:22:33,655 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-15 12:22:33,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-15 12:22:33,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-15 12:22:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 12:22:33,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:33,778 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-15 12:22:33,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:33,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:22:33,978 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 49 times [2022-04-15 12:22:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124058745] [2022-04-15 12:22:33,986 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:33,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 50 times [2022-04-15 12:22:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802070723] [2022-04-15 12:22:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:34,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {22733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {22702#true} assume true; {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22702#true} {22702#true} #58#return; {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {22702#true} call ULTIMATE.init(); {22733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:34,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {22733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {22702#true} assume true; {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22702#true} {22702#true} #58#return; {22702#true} is VALID [2022-04-15 12:22:34,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {22702#true} call #t~ret8 := main(); {22702#true} is VALID [2022-04-15 12:22:34,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {22702#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; {22707#(= main_~i~0 0)} is VALID [2022-04-15 12:22:34,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {22707#(= 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; {22707#(= main_~i~0 0)} is VALID [2022-04-15 12:22:34,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {22707#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22708#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:34,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {22708#(<= 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; {22708#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:34,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {22708#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:34,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {22709#(<= 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; {22709#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:34,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {22709#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:34,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {22710#(<= 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; {22710#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:34,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {22710#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:34,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {22711#(<= 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; {22711#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:34,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {22711#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:34,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {22712#(<= 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; {22712#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:34,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {22712#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:34,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {22713#(<= 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; {22713#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:34,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {22713#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:34,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {22714#(<= 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; {22714#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:34,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {22714#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:34,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {22715#(<= 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; {22715#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:34,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {22715#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:34,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {22716#(<= 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; {22716#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:34,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {22716#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:34,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {22717#(<= 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; {22717#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:34,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {22717#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:34,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {22718#(<= 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; {22718#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:34,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {22718#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:34,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {22719#(<= 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; {22719#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:34,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {22719#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:34,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {22720#(<= 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; {22720#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:34,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {22720#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:34,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {22721#(<= 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; {22721#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:34,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {22721#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:34,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {22722#(<= 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; {22722#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:34,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {22722#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:34,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {22723#(<= 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; {22723#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:34,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {22723#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:34,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {22724#(<= 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; {22724#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:34,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {22724#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:34,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {22725#(<= 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; {22725#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:34,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {22725#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:34,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {22726#(<= 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; {22726#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:34,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {22726#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:34,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {22727#(<= 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; {22727#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:34,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {22727#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:34,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {22728#(<= 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; {22728#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:34,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {22728#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:34,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {22729#(<= 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; {22729#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:34,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {22729#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:34,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {22730#(<= 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; {22730#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:34,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {22730#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:34,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {22731#(<= 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; {22731#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:34,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {22731#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:34,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {22732#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:34,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {22703#false} ~i~0 := 0; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 66: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 73: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 77: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 79: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 82: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 83: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 87: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 90: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 91: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 92: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 93: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 94: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 95: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 96: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 97: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 98: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 99: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,352 INFO L290 TraceCheckUtils]: 100: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 105: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 106: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 107: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 108: Hoare triple {22703#false} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 109: Hoare triple {22703#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); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L272 TraceCheckUtils]: 110: Hoare triple {22703#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 111: Hoare triple {22703#false} ~cond := #in~cond; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 112: Hoare triple {22703#false} assume 0 == ~cond; {22703#false} is VALID [2022-04-15 12:22:34,353 INFO L290 TraceCheckUtils]: 113: Hoare triple {22703#false} assume !false; {22703#false} is VALID [2022-04-15 12:22:34,354 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-15 12:22:34,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:34,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802070723] [2022-04-15 12:22:34,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802070723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:34,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961646782] [2022-04-15 12:22:34,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:22:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:34,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:34,355 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:22:34,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:22:34,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:22:34,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:34,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:22:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:34,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:35,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {22702#true} call ULTIMATE.init(); {22702#true} is VALID [2022-04-15 12:22:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {22702#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22702#true} is VALID [2022-04-15 12:22:35,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {22702#true} assume true; {22702#true} is VALID [2022-04-15 12:22:35,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22702#true} {22702#true} #58#return; {22702#true} is VALID [2022-04-15 12:22:35,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {22702#true} call #t~ret8 := main(); {22702#true} is VALID [2022-04-15 12:22:35,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {22702#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; {22752#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:35,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {22752#(<= 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; {22752#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:35,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {22752#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22708#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:35,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {22708#(<= 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; {22708#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:35,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {22708#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:35,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {22709#(<= 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; {22709#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:35,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {22709#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:35,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {22710#(<= 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; {22710#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:35,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {22710#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:35,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {22711#(<= 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; {22711#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:35,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {22711#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:35,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {22712#(<= 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; {22712#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:35,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {22712#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:35,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {22713#(<= 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; {22713#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:35,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {22713#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:35,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {22714#(<= 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; {22714#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:35,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {22714#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:35,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {22715#(<= 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; {22715#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:35,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {22715#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:35,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {22716#(<= 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; {22716#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:35,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {22716#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:35,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {22717#(<= 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; {22717#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:35,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {22717#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:35,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {22718#(<= 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; {22718#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:35,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {22718#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:35,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {22719#(<= 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; {22719#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:35,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {22719#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:35,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {22720#(<= 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; {22720#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:35,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {22720#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:35,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {22721#(<= 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; {22721#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:35,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {22721#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:35,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {22722#(<= 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; {22722#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:35,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {22722#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:35,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {22723#(<= 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; {22723#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:35,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {22723#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:35,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {22724#(<= 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; {22724#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:35,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {22724#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:35,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {22725#(<= 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; {22725#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:35,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {22725#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:35,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {22726#(<= 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; {22726#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:35,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {22726#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:35,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {22727#(<= 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; {22727#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:35,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {22727#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:35,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {22728#(<= 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; {22728#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:35,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {22728#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:35,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {22729#(<= 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; {22729#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:35,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {22729#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:35,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {22730#(<= 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; {22730#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:35,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {22730#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:35,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {22731#(<= 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; {22731#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {22731#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {22732#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {22703#false} ~i~0 := 0; {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 74: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 103: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 104: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 105: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 106: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:35,080 INFO L290 TraceCheckUtils]: 107: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L290 TraceCheckUtils]: 108: Hoare triple {22703#false} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L290 TraceCheckUtils]: 109: Hoare triple {22703#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); {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L272 TraceCheckUtils]: 110: Hoare triple {22703#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {22703#false} ~cond := #in~cond; {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {22703#false} assume 0 == ~cond; {22703#false} is VALID [2022-04-15 12:22:35,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {22703#false} assume !false; {22703#false} is VALID [2022-04-15 12:22:35,081 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-15 12:22:35,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:36,034 INFO L290 TraceCheckUtils]: 113: Hoare triple {22703#false} assume !false; {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L290 TraceCheckUtils]: 112: Hoare triple {22703#false} assume 0 == ~cond; {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L290 TraceCheckUtils]: 111: Hoare triple {22703#false} ~cond := #in~cond; {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L272 TraceCheckUtils]: 110: Hoare triple {22703#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L290 TraceCheckUtils]: 109: Hoare triple {22703#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); {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L290 TraceCheckUtils]: 108: Hoare triple {22703#false} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:36,035 INFO L290 TraceCheckUtils]: 107: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 106: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 103: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 102: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 99: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 98: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 97: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 96: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 95: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 94: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 93: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 91: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 90: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 89: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 88: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 87: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 86: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {22703#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {22703#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#false} is VALID [2022-04-15 12:22:36,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {22703#false} ~i~0 := 0; {22703#false} is VALID [2022-04-15 12:22:36,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {23248#(< main_~i~0 2048)} assume !(~i~0 < 2048); {22703#false} is VALID [2022-04-15 12:22:36,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {23252#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23248#(< main_~i~0 2048)} is VALID [2022-04-15 12:22:36,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {23252#(< 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; {23252#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:36,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {23259#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23252#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:36,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {23259#(< 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; {23259#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:36,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {23266#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23259#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:36,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {23266#(< 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; {23266#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:36,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {23273#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23266#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:36,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {23273#(< 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; {23273#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:36,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {23280#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23273#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:36,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {23280#(< 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; {23280#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:36,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {23287#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23280#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:36,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {23287#(< 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; {23287#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:36,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {23294#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23287#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:36,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {23294#(< 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; {23294#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:36,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {23301#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23294#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:36,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {23301#(< 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; {23301#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:36,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {23308#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23301#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:36,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {23308#(< 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; {23308#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:36,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {23315#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23308#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:36,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {23315#(< 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; {23315#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:36,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {23322#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23315#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:36,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {23322#(< 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; {23322#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:36,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {23329#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23322#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:36,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {23329#(< 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; {23329#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:36,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {23336#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23329#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:36,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {23336#(< 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; {23336#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:36,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {23343#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23336#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:36,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {23343#(< 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; {23343#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:36,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {23350#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23343#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:36,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {23350#(< 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; {23350#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:36,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {23357#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23350#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:36,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {23357#(< 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; {23357#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:36,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {23364#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23357#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:36,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {23364#(< 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; {23364#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:36,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {23371#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23364#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:36,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {23371#(< 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; {23371#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:36,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {23378#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23371#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:36,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {23378#(< 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; {23378#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:36,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {23385#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23378#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:36,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {23385#(< 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; {23385#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:36,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {23392#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23385#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:36,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {23392#(< 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; {23392#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:36,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {23399#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23392#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:36,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {23399#(< 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; {23399#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:36,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {23406#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23399#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:36,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {23406#(< 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; {23406#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:36,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {23413#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23406#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:36,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {23413#(< 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; {23413#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:36,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {23420#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23413#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:36,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {23420#(< 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; {23420#(< main_~i~0 2023)} is VALID [2022-04-15 12:22:36,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {22702#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; {23420#(< main_~i~0 2023)} is VALID [2022-04-15 12:22:36,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {22702#true} call #t~ret8 := main(); {22702#true} is VALID [2022-04-15 12:22:36,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22702#true} {22702#true} #58#return; {22702#true} is VALID [2022-04-15 12:22:36,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {22702#true} assume true; {22702#true} is VALID [2022-04-15 12:22:36,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {22702#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {22702#true} is VALID [2022-04-15 12:22:36,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {22702#true} call ULTIMATE.init(); {22702#true} is VALID [2022-04-15 12:22:36,057 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-15 12:22:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961646782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:36,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:36,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 12:22:36,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124058745] [2022-04-15 12:22:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124058745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:36,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:36,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:22:36,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163155304] [2022-04-15 12:22:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:36,058 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-15 12:22:36,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:36,058 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-15 12:22:36,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:36,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:22:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:22:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:22:36,102 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-15 12:22:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:37,072 INFO L93 Difference]: Finished difference Result 179 states and 182 transitions. [2022-04-15 12:22:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:22:37,072 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-15 12:22:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:37,072 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-15 12:22:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-15 12:22:37,074 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-15 12:22:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-15 12:22:37,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 133 transitions. [2022-04-15 12:22:37,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:37,184 INFO L225 Difference]: With dead ends: 179 [2022-04-15 12:22:37,184 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 12:22:37,185 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-15 12:22:37,185 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 166 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:37,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 31 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:22:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 12:22:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-04-15 12:22:37,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:37,487 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-15 12:22:37,488 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-15 12:22:37,488 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-15 12:22:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:37,489 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-15 12:22:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 12:22:37,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:37,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:37,489 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-15 12:22:37,489 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-15 12:22:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:37,490 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-15 12:22:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 12:22:37,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:37,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:37,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:37,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:37,491 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-15 12:22:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 12:22:37,492 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-15 12:22:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:37,492 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 12:22:37,492 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-15 12:22:37,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 12:22:37,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:22:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 12:22:37,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:37,603 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-15 12:22:37,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:37,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 12:22:37,819 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:37,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 51 times [2022-04-15 12:22:37,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:37,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959258854] [2022-04-15 12:22:37,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:37,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 52 times [2022-04-15 12:22:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:37,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992207853] [2022-04-15 12:22:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:38,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {24366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24334#true} is VALID [2022-04-15 12:22:38,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {24334#true} assume true; {24334#true} is VALID [2022-04-15 12:22:38,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24334#true} {24334#true} #58#return; {24334#true} is VALID [2022-04-15 12:22:38,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {24334#true} call ULTIMATE.init(); {24366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:38,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {24366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24334#true} is VALID [2022-04-15 12:22:38,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {24334#true} assume true; {24334#true} is VALID [2022-04-15 12:22:38,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24334#true} {24334#true} #58#return; {24334#true} is VALID [2022-04-15 12:22:38,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {24334#true} call #t~ret8 := main(); {24334#true} is VALID [2022-04-15 12:22:38,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {24334#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; {24339#(= main_~i~0 0)} is VALID [2022-04-15 12:22:38,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {24339#(= 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; {24339#(= main_~i~0 0)} is VALID [2022-04-15 12:22:38,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {24339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24340#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:38,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {24340#(<= 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; {24340#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:38,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {24340#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:38,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {24341#(<= 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; {24341#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:38,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {24341#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:38,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {24342#(<= 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; {24342#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:38,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {24342#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:38,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {24343#(<= 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; {24343#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:38,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {24343#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:38,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {24344#(<= 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; {24344#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:38,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {24344#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:38,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {24345#(<= 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; {24345#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:38,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {24345#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:38,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {24346#(<= 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; {24346#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:38,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {24346#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:38,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {24347#(<= 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; {24347#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:38,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {24347#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:38,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {24348#(<= 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; {24348#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:38,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {24348#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:38,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {24349#(<= 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; {24349#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:38,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {24349#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:38,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {24350#(<= 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; {24350#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:38,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {24350#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:38,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {24351#(<= 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; {24351#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:38,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {24351#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:38,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {24352#(<= 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; {24352#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:38,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {24352#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:38,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {24353#(<= 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; {24353#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:38,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {24353#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:38,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {24354#(<= 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; {24354#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:38,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {24354#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:38,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {24355#(<= 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; {24355#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:38,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {24355#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:38,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {24356#(<= 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; {24356#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:38,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {24356#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:38,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {24357#(<= 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; {24357#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:38,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {24357#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:38,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {24358#(<= 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; {24358#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:38,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {24358#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:38,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {24359#(<= 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; {24359#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:38,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {24359#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:38,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {24360#(<= 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; {24360#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:38,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {24360#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:38,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {24361#(<= 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; {24361#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:38,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {24361#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:38,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {24362#(<= 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; {24362#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:38,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {24362#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:38,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {24363#(<= 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; {24363#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:38,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {24363#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:38,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {24364#(<= 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; {24364#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {24364#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {24365#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {24335#false} ~i~0 := 0; {24335#false} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 69: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 70: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 79: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 80: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 83: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,245 INFO L290 TraceCheckUtils]: 84: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 87: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 88: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 89: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 90: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 91: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,246 INFO L290 TraceCheckUtils]: 92: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 95: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 97: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 99: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 100: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 101: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 102: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 103: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 104: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 105: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,247 INFO L290 TraceCheckUtils]: 107: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,248 INFO L290 TraceCheckUtils]: 108: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,248 INFO L290 TraceCheckUtils]: 109: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,248 INFO L290 TraceCheckUtils]: 110: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 111: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 112: Hoare triple {24335#false} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 113: Hoare triple {24335#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); {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L272 TraceCheckUtils]: 114: Hoare triple {24335#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 115: Hoare triple {24335#false} ~cond := #in~cond; {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 116: Hoare triple {24335#false} assume 0 == ~cond; {24335#false} is VALID [2022-04-15 12:22:38,251 INFO L290 TraceCheckUtils]: 117: Hoare triple {24335#false} assume !false; {24335#false} is VALID [2022-04-15 12:22:38,252 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-15 12:22:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:38,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992207853] [2022-04-15 12:22:38,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992207853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:38,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036530971] [2022-04-15 12:22:38,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:38,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:38,253 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:22:38,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:22:38,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:38,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:38,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:22:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:38,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:39,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {24334#true} call ULTIMATE.init(); {24334#true} is VALID [2022-04-15 12:22:39,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {24334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24334#true} is VALID [2022-04-15 12:22:39,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {24334#true} assume true; {24334#true} is VALID [2022-04-15 12:22:39,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24334#true} {24334#true} #58#return; {24334#true} is VALID [2022-04-15 12:22:39,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {24334#true} call #t~ret8 := main(); {24334#true} is VALID [2022-04-15 12:22:39,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {24334#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; {24385#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:39,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {24385#(<= 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; {24385#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:39,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {24385#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24340#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:39,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {24340#(<= 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; {24340#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:39,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {24340#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:39,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {24341#(<= 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; {24341#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:39,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {24341#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:39,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {24342#(<= 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; {24342#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:39,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {24342#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:39,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {24343#(<= 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; {24343#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:39,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {24343#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:39,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {24344#(<= 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; {24344#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:39,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {24344#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:39,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {24345#(<= 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; {24345#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:39,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {24345#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:39,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {24346#(<= 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; {24346#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:39,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {24346#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:39,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {24347#(<= 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; {24347#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:39,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {24347#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:39,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {24348#(<= 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; {24348#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:39,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {24348#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:39,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {24349#(<= 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; {24349#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:39,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {24349#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:39,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {24350#(<= 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; {24350#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:39,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {24350#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:39,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {24351#(<= 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; {24351#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:39,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {24351#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:39,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {24352#(<= 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; {24352#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:39,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {24352#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:39,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {24353#(<= 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; {24353#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:39,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {24353#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:39,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {24354#(<= 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; {24354#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:39,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {24354#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:39,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {24355#(<= 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; {24355#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:39,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {24355#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:39,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {24356#(<= 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; {24356#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:39,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {24356#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:39,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {24357#(<= 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; {24357#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:39,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {24357#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:39,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {24358#(<= 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; {24358#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:39,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {24358#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:39,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {24359#(<= 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; {24359#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:39,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {24359#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:39,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {24360#(<= 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; {24360#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:39,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {24360#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:39,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {24361#(<= 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; {24361#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:39,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {24361#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:39,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {24362#(<= 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; {24362#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:39,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {24362#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:39,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {24363#(<= 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; {24363#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:39,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {24363#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:39,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {24364#(<= 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; {24364#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:39,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {24364#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:39,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {24365#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:39,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {24335#false} ~i~0 := 0; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 90: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 92: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 103: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 106: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 107: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 108: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 109: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {24335#false} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {24335#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); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L272 TraceCheckUtils]: 114: Hoare triple {24335#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 115: Hoare triple {24335#false} ~cond := #in~cond; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 116: Hoare triple {24335#false} assume 0 == ~cond; {24335#false} is VALID [2022-04-15 12:22:39,081 INFO L290 TraceCheckUtils]: 117: Hoare triple {24335#false} assume !false; {24335#false} is VALID [2022-04-15 12:22:39,082 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-15 12:22:39,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 117: Hoare triple {24335#false} assume !false; {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {24335#false} assume 0 == ~cond; {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 115: Hoare triple {24335#false} ~cond := #in~cond; {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L272 TraceCheckUtils]: 114: Hoare triple {24335#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 113: Hoare triple {24335#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); {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {24335#false} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 109: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 107: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 106: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 103: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 95: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 91: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 90: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 89: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 88: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 87: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 86: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 79: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {24335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {24335#false} ~i~0 := 0; {24335#false} is VALID [2022-04-15 12:22:40,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {24899#(< main_~i~0 2048)} assume !(~i~0 < 2048); {24335#false} is VALID [2022-04-15 12:22:40,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {24903#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24899#(< main_~i~0 2048)} is VALID [2022-04-15 12:22:40,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {24903#(< 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; {24903#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:40,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {24910#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24903#(< main_~i~0 2047)} is VALID [2022-04-15 12:22:40,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {24910#(< 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; {24910#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:40,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {24917#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24910#(< main_~i~0 2046)} is VALID [2022-04-15 12:22:40,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {24917#(< 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; {24917#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:40,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {24924#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24917#(< main_~i~0 2045)} is VALID [2022-04-15 12:22:40,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {24924#(< 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; {24924#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:40,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {24931#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24924#(< main_~i~0 2044)} is VALID [2022-04-15 12:22:40,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {24931#(< 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; {24931#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:40,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {24938#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24931#(< main_~i~0 2043)} is VALID [2022-04-15 12:22:40,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {24938#(< 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; {24938#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:40,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {24945#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24938#(< main_~i~0 2042)} is VALID [2022-04-15 12:22:40,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {24945#(< 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; {24945#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:40,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {24952#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#(< main_~i~0 2041)} is VALID [2022-04-15 12:22:40,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {24952#(< 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; {24952#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:40,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {24959#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24952#(< main_~i~0 2040)} is VALID [2022-04-15 12:22:40,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {24959#(< 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; {24959#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:40,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {24966#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24959#(< main_~i~0 2039)} is VALID [2022-04-15 12:22:40,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {24966#(< 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; {24966#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:40,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {24973#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24966#(< main_~i~0 2038)} is VALID [2022-04-15 12:22:40,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {24973#(< 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; {24973#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:40,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {24980#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24973#(< main_~i~0 2037)} is VALID [2022-04-15 12:22:40,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {24980#(< 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; {24980#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:40,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {24987#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24980#(< main_~i~0 2036)} is VALID [2022-04-15 12:22:40,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {24987#(< 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; {24987#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:40,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {24994#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24987#(< main_~i~0 2035)} is VALID [2022-04-15 12:22:40,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {24994#(< 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; {24994#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:40,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {25001#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24994#(< main_~i~0 2034)} is VALID [2022-04-15 12:22:40,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {25001#(< 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; {25001#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:40,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {25008#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25001#(< main_~i~0 2033)} is VALID [2022-04-15 12:22:40,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {25008#(< 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; {25008#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:40,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {25015#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25008#(< main_~i~0 2032)} is VALID [2022-04-15 12:22:40,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {25015#(< 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; {25015#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:40,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {25022#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25015#(< main_~i~0 2031)} is VALID [2022-04-15 12:22:40,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {25022#(< 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; {25022#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:40,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {25029#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25022#(< main_~i~0 2030)} is VALID [2022-04-15 12:22:40,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {25029#(< 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; {25029#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:40,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {25036#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25029#(< main_~i~0 2029)} is VALID [2022-04-15 12:22:40,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {25036#(< 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; {25036#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:40,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {25043#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25036#(< main_~i~0 2028)} is VALID [2022-04-15 12:22:40,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {25043#(< 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; {25043#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:40,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {25050#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25043#(< main_~i~0 2027)} is VALID [2022-04-15 12:22:40,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {25050#(< 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; {25050#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:40,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {25057#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25050#(< main_~i~0 2026)} is VALID [2022-04-15 12:22:40,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {25057#(< 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; {25057#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:40,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {25064#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25057#(< main_~i~0 2025)} is VALID [2022-04-15 12:22:40,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {25064#(< 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; {25064#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:40,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {25071#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25064#(< main_~i~0 2024)} is VALID [2022-04-15 12:22:40,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {25071#(< 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; {25071#(< main_~i~0 2023)} is VALID [2022-04-15 12:22:40,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {25078#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25071#(< main_~i~0 2023)} is VALID [2022-04-15 12:22:40,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {25078#(< 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; {25078#(< main_~i~0 2022)} is VALID [2022-04-15 12:22:40,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {24334#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; {25078#(< main_~i~0 2022)} is VALID [2022-04-15 12:22:40,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {24334#true} call #t~ret8 := main(); {24334#true} is VALID [2022-04-15 12:22:40,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24334#true} {24334#true} #58#return; {24334#true} is VALID [2022-04-15 12:22:40,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {24334#true} assume true; {24334#true} is VALID [2022-04-15 12:22:40,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {24334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24334#true} is VALID [2022-04-15 12:22:40,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {24334#true} call ULTIMATE.init(); {24334#true} is VALID [2022-04-15 12:22:40,148 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-15 12:22:40,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036530971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:40,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:40,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 12:22:40,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959258854] [2022-04-15 12:22:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959258854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:40,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:40,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:22:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232004901] [2022-04-15 12:22:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:40,149 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-15 12:22:40,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:40,150 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-15 12:22:40,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:40,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:22:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:22:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:22:40,203 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-15 12:22:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:41,239 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2022-04-15 12:22:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:22:41,240 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-15 12:22:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:41,240 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-15 12:22:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-15 12:22:41,241 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-15 12:22:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-15 12:22:41,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 137 transitions. [2022-04-15 12:22:41,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:41,339 INFO L225 Difference]: With dead ends: 185 [2022-04-15 12:22:41,339 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 12:22:41,340 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-15 12:22:41,340 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:41,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 31 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:22:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 12:22:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-15 12:22:41,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:41,622 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-15 12:22:41,622 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-15 12:22:41,622 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-15 12:22:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:41,623 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 12:22:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 12:22:41,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:41,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:41,624 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-15 12:22:41,624 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-15 12:22:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:41,625 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 12:22:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 12:22:41,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:41,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:41,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:41,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:41,625 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-15 12:22:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-04-15 12:22:41,627 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2022-04-15 12:22:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:41,627 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-04-15 12:22:41,627 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-15 12:22:41,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 124 transitions. [2022-04-15 12:22:41,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2022-04-15 12:22:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 12:22:41,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:41,752 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-15 12:22:41,771 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-15 12:22:41,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 12:22:41,971 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 53 times [2022-04-15 12:22:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:41,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144697738] [2022-04-15 12:22:41,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:41,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 54 times [2022-04-15 12:22:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048082928] [2022-04-15 12:22:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:42,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {26055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26022#true} is VALID [2022-04-15 12:22:42,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {26022#true} assume true; {26022#true} is VALID [2022-04-15 12:22:42,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26022#true} {26022#true} #58#return; {26022#true} is VALID [2022-04-15 12:22:42,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {26022#true} call ULTIMATE.init(); {26055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:42,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {26055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26022#true} is VALID [2022-04-15 12:22:42,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {26022#true} assume true; {26022#true} is VALID [2022-04-15 12:22:42,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26022#true} {26022#true} #58#return; {26022#true} is VALID [2022-04-15 12:22:42,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {26022#true} call #t~ret8 := main(); {26022#true} is VALID [2022-04-15 12:22:42,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {26022#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; {26027#(= main_~i~0 0)} is VALID [2022-04-15 12:22:42,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {26027#(= 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; {26027#(= main_~i~0 0)} is VALID [2022-04-15 12:22:42,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {26027#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26028#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:42,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {26028#(<= 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; {26028#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:42,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {26028#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:42,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {26029#(<= 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; {26029#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:42,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {26029#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:42,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {26030#(<= 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; {26030#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:42,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {26030#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:42,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#(<= 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; {26031#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:42,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {26031#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:42,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {26032#(<= 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; {26032#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:42,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {26032#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:42,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {26033#(<= 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; {26033#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:42,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {26033#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:42,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {26034#(<= 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; {26034#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:42,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {26034#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:42,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {26035#(<= 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; {26035#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:42,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {26035#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:42,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {26036#(<= 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; {26036#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:42,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {26036#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:42,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {26037#(<= 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; {26037#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:42,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {26037#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:42,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {26038#(<= 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; {26038#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:42,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {26038#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:42,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {26039#(<= 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; {26039#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:42,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {26039#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:42,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {26040#(<= 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; {26040#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:42,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {26040#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:42,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {26041#(<= 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; {26041#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:42,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {26041#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:42,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {26042#(<= 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; {26042#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:42,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {26042#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:42,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {26043#(<= 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; {26043#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:42,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {26043#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:42,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {26044#(<= 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; {26044#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:42,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {26044#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:42,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {26045#(<= 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; {26045#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:42,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {26045#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:42,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {26046#(<= 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; {26046#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:42,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {26046#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:42,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {26047#(<= 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; {26047#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:42,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {26047#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:42,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {26048#(<= 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; {26048#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:42,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {26048#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:42,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {26049#(<= 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; {26049#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:42,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {26049#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:42,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {26050#(<= 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; {26050#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:42,387 INFO L290 TraceCheckUtils]: 53: Hoare triple {26050#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:42,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {26051#(<= 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; {26051#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:42,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {26051#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:42,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {26052#(<= 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; {26052#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:42,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {26052#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {26053#(<= 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; {26053#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {26053#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {26054#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {26023#false} ~i~0 := 0; {26023#false} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 72: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 73: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 74: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 79: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 80: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 83: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 91: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 92: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,391 INFO L290 TraceCheckUtils]: 93: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 94: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 95: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 96: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 97: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 99: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 101: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 102: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 103: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 104: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 105: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 106: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 107: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,392 INFO L290 TraceCheckUtils]: 108: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 109: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 110: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 111: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 112: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 113: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 115: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 116: Hoare triple {26023#false} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 117: Hoare triple {26023#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); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L272 TraceCheckUtils]: 118: Hoare triple {26023#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 119: Hoare triple {26023#false} ~cond := #in~cond; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 120: Hoare triple {26023#false} assume 0 == ~cond; {26023#false} is VALID [2022-04-15 12:22:42,393 INFO L290 TraceCheckUtils]: 121: Hoare triple {26023#false} assume !false; {26023#false} is VALID [2022-04-15 12:22:42,394 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-15 12:22:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:42,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048082928] [2022-04-15 12:22:42,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048082928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:42,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895846032] [2022-04-15 12:22:42,396 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:22:42,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:42,397 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:22:42,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:29:53,316 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 12:29:53,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:29:53,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:29:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:53,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:29:53,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {26022#true} call ULTIMATE.init(); {26022#true} is VALID [2022-04-15 12:29:53,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {26022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26022#true} is VALID [2022-04-15 12:29:53,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {26022#true} assume true; {26022#true} is VALID [2022-04-15 12:29:53,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26022#true} {26022#true} #58#return; {26022#true} is VALID [2022-04-15 12:29:53,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {26022#true} call #t~ret8 := main(); {26022#true} is VALID [2022-04-15 12:29:53,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {26022#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; {26074#(<= main_~i~0 0)} is VALID [2022-04-15 12:29:53,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {26074#(<= 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; {26074#(<= main_~i~0 0)} is VALID [2022-04-15 12:29:53,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {26074#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26028#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:53,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {26028#(<= 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; {26028#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:53,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {26028#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:53,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {26029#(<= 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; {26029#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:53,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {26029#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:53,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {26030#(<= 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; {26030#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:53,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {26030#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:53,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#(<= 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; {26031#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:53,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {26031#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:53,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {26032#(<= 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; {26032#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:53,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {26032#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:53,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {26033#(<= 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; {26033#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:53,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {26033#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:53,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {26034#(<= 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; {26034#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:53,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {26034#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:53,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {26035#(<= 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; {26035#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:53,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {26035#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:53,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {26036#(<= 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; {26036#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:53,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {26036#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:53,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {26037#(<= 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; {26037#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:53,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {26037#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:53,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {26038#(<= 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; {26038#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:53,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {26038#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:53,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {26039#(<= 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; {26039#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:53,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {26039#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:53,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {26040#(<= 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; {26040#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:53,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {26040#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:53,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {26041#(<= 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; {26041#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:53,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {26041#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:53,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {26042#(<= 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; {26042#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:53,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {26042#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:53,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {26043#(<= 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; {26043#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:53,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {26043#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:53,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {26044#(<= 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; {26044#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:53,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {26044#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:53,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {26045#(<= 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; {26045#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:53,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {26045#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:53,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {26046#(<= 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; {26046#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:53,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {26046#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:53,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {26047#(<= 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; {26047#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:53,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {26047#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:53,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {26048#(<= 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; {26048#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:53,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {26048#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:53,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {26049#(<= 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; {26049#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:53,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {26049#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:53,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {26050#(<= 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; {26050#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:53,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {26050#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:53,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {26051#(<= 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; {26051#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:53,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {26051#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:53,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {26052#(<= 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; {26052#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:53,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {26052#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:53,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {26053#(<= 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; {26053#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 59: Hoare triple {26053#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 27)} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {26054#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {26023#false} ~i~0 := 0; {26023#false} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 73: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 77: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 78: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,961 INFO L290 TraceCheckUtils]: 79: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 80: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 81: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 83: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 84: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 85: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 86: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 87: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 90: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 92: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,962 INFO L290 TraceCheckUtils]: 93: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 94: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 95: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 96: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 97: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 98: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 99: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 100: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 101: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 102: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 103: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 104: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 105: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 106: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 107: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,963 INFO L290 TraceCheckUtils]: 108: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 109: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 110: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 111: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 112: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 113: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 114: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 115: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 116: Hoare triple {26023#false} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 117: Hoare triple {26023#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); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L272 TraceCheckUtils]: 118: Hoare triple {26023#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 119: Hoare triple {26023#false} ~cond := #in~cond; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 120: Hoare triple {26023#false} assume 0 == ~cond; {26023#false} is VALID [2022-04-15 12:29:53,964 INFO L290 TraceCheckUtils]: 121: Hoare triple {26023#false} assume !false; {26023#false} is VALID [2022-04-15 12:29:53,965 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-15 12:29:53,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:29:54,998 INFO L290 TraceCheckUtils]: 121: Hoare triple {26023#false} assume !false; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 120: Hoare triple {26023#false} assume 0 == ~cond; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 119: Hoare triple {26023#false} ~cond := #in~cond; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L272 TraceCheckUtils]: 118: Hoare triple {26023#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {26023#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); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {26023#false} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 115: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 112: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 111: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 110: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:54,999 INFO L290 TraceCheckUtils]: 109: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 108: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 107: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 106: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 105: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 104: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 103: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 102: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 99: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 98: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 97: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 96: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,000 INFO L290 TraceCheckUtils]: 95: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 94: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 93: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 92: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 91: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 90: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 88: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 87: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 73: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 72: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 71: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 70: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 69: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 68: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 67: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,002 INFO L290 TraceCheckUtils]: 66: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {26023#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26023#false} is VALID [2022-04-15 12:29:55,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {26023#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26023#false} is VALID [2022-04-15 12:29:55,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {26023#false} ~i~0 := 0; {26023#false} is VALID [2022-04-15 12:29:55,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {26606#(< main_~i~0 2048)} assume !(~i~0 < 2048); {26023#false} is VALID [2022-04-15 12:29:55,004 INFO L290 TraceCheckUtils]: 59: Hoare triple {26610#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26606#(< main_~i~0 2048)} is VALID [2022-04-15 12:29:55,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {26610#(< 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; {26610#(< main_~i~0 2047)} is VALID [2022-04-15 12:29:55,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {26617#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26610#(< main_~i~0 2047)} is VALID [2022-04-15 12:29:55,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {26617#(< 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; {26617#(< main_~i~0 2046)} is VALID [2022-04-15 12:29:55,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {26624#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26617#(< main_~i~0 2046)} is VALID [2022-04-15 12:29:55,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {26624#(< 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; {26624#(< main_~i~0 2045)} is VALID [2022-04-15 12:29:55,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {26631#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26624#(< main_~i~0 2045)} is VALID [2022-04-15 12:29:55,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {26631#(< 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; {26631#(< main_~i~0 2044)} is VALID [2022-04-15 12:29:55,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {26638#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26631#(< main_~i~0 2044)} is VALID [2022-04-15 12:29:55,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {26638#(< 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; {26638#(< main_~i~0 2043)} is VALID [2022-04-15 12:29:55,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {26645#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26638#(< main_~i~0 2043)} is VALID [2022-04-15 12:29:55,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {26645#(< 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; {26645#(< main_~i~0 2042)} is VALID [2022-04-15 12:29:55,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {26652#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26645#(< main_~i~0 2042)} is VALID [2022-04-15 12:29:55,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {26652#(< 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; {26652#(< main_~i~0 2041)} is VALID [2022-04-15 12:29:55,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {26659#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26652#(< main_~i~0 2041)} is VALID [2022-04-15 12:29:55,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {26659#(< 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; {26659#(< main_~i~0 2040)} is VALID [2022-04-15 12:29:55,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {26666#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26659#(< main_~i~0 2040)} is VALID [2022-04-15 12:29:55,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {26666#(< 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; {26666#(< main_~i~0 2039)} is VALID [2022-04-15 12:29:55,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {26673#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26666#(< main_~i~0 2039)} is VALID [2022-04-15 12:29:55,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {26673#(< 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; {26673#(< main_~i~0 2038)} is VALID [2022-04-15 12:29:55,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {26680#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26673#(< main_~i~0 2038)} is VALID [2022-04-15 12:29:55,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {26680#(< 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; {26680#(< main_~i~0 2037)} is VALID [2022-04-15 12:29:55,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {26687#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26680#(< main_~i~0 2037)} is VALID [2022-04-15 12:29:55,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {26687#(< 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; {26687#(< main_~i~0 2036)} is VALID [2022-04-15 12:29:55,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {26694#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26687#(< main_~i~0 2036)} is VALID [2022-04-15 12:29:55,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {26694#(< 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; {26694#(< main_~i~0 2035)} is VALID [2022-04-15 12:29:55,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {26701#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26694#(< main_~i~0 2035)} is VALID [2022-04-15 12:29:55,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {26701#(< 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; {26701#(< main_~i~0 2034)} is VALID [2022-04-15 12:29:55,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {26708#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26701#(< main_~i~0 2034)} is VALID [2022-04-15 12:29:55,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {26708#(< 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; {26708#(< main_~i~0 2033)} is VALID [2022-04-15 12:29:55,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {26715#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26708#(< main_~i~0 2033)} is VALID [2022-04-15 12:29:55,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {26715#(< 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; {26715#(< main_~i~0 2032)} is VALID [2022-04-15 12:29:55,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {26722#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26715#(< main_~i~0 2032)} is VALID [2022-04-15 12:29:55,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {26722#(< 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; {26722#(< main_~i~0 2031)} is VALID [2022-04-15 12:29:55,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {26729#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26722#(< main_~i~0 2031)} is VALID [2022-04-15 12:29:55,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {26729#(< 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; {26729#(< main_~i~0 2030)} is VALID [2022-04-15 12:29:55,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {26736#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26729#(< main_~i~0 2030)} is VALID [2022-04-15 12:29:55,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {26736#(< 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; {26736#(< main_~i~0 2029)} is VALID [2022-04-15 12:29:55,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {26743#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26736#(< main_~i~0 2029)} is VALID [2022-04-15 12:29:55,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {26743#(< 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; {26743#(< main_~i~0 2028)} is VALID [2022-04-15 12:29:55,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {26750#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26743#(< main_~i~0 2028)} is VALID [2022-04-15 12:29:55,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {26750#(< 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; {26750#(< main_~i~0 2027)} is VALID [2022-04-15 12:29:55,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {26757#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26750#(< main_~i~0 2027)} is VALID [2022-04-15 12:29:55,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {26757#(< 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; {26757#(< main_~i~0 2026)} is VALID [2022-04-15 12:29:55,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {26764#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26757#(< main_~i~0 2026)} is VALID [2022-04-15 12:29:55,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {26764#(< 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; {26764#(< main_~i~0 2025)} is VALID [2022-04-15 12:29:55,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {26771#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26764#(< main_~i~0 2025)} is VALID [2022-04-15 12:29:55,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {26771#(< 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; {26771#(< main_~i~0 2024)} is VALID [2022-04-15 12:29:55,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {26778#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26771#(< main_~i~0 2024)} is VALID [2022-04-15 12:29:55,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {26778#(< 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; {26778#(< main_~i~0 2023)} is VALID [2022-04-15 12:29:55,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {26785#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26778#(< main_~i~0 2023)} is VALID [2022-04-15 12:29:55,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {26785#(< 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; {26785#(< main_~i~0 2022)} is VALID [2022-04-15 12:29:55,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {26792#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26785#(< main_~i~0 2022)} is VALID [2022-04-15 12:29:55,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {26792#(< 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; {26792#(< main_~i~0 2021)} is VALID [2022-04-15 12:29:55,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {26022#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; {26792#(< main_~i~0 2021)} is VALID [2022-04-15 12:29:55,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {26022#true} call #t~ret8 := main(); {26022#true} is VALID [2022-04-15 12:29:55,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26022#true} {26022#true} #58#return; {26022#true} is VALID [2022-04-15 12:29:55,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {26022#true} assume true; {26022#true} is VALID [2022-04-15 12:29:55,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {26022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26022#true} is VALID [2022-04-15 12:29:55,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {26022#true} call ULTIMATE.init(); {26022#true} is VALID [2022-04-15 12:29:55,021 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-15 12:29:55,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895846032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:29:55,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:29:55,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 12:29:55,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144697738] [2022-04-15 12:29:55,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144697738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:55,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:55,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:29:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098492066] [2022-04-15 12:29:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:55,026 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-15 12:29:55,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:55,027 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-15 12:29:55,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:55,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:29:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:29:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:29:55,070 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-15 12:29:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:56,100 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-15 12:29:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:29:56,100 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-15 12:29:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:56,101 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-15 12:29:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-15 12:29:56,102 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-15 12:29:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-15 12:29:56,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 141 transitions. [2022-04-15 12:29:56,202 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-15 12:29:56,203 INFO L225 Difference]: With dead ends: 191 [2022-04-15 12:29:56,204 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 12:29:56,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:29:56,205 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:56,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 41 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:29:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 12:29:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-04-15 12:29:56,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:56,504 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-15 12:29:56,504 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-15 12:29:56,504 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-15 12:29:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:56,505 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-15 12:29:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 12:29:56,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:56,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:56,506 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-15 12:29:56,506 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-15 12:29:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:56,507 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-15 12:29:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 12:29:56,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:56,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:56,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:56,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:56,507 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-15 12:29:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 12:29:56,508 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2022-04-15 12:29:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:56,509 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 12:29:56,509 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-15 12:29:56,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 12:29:56,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 12:29:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 12:29:56,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:56,626 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-15 12:29:56,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:29:56,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:29:56,826 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:29:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 55 times [2022-04-15 12:29:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:56,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677594820] [2022-04-15 12:29:56,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:29:56,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:29:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 56 times [2022-04-15 12:29:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587081347] [2022-04-15 12:29:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:57,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {27800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {27766#true} assume true; {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27766#true} {27766#true} #58#return; {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {27766#true} call ULTIMATE.init(); {27800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:29:57,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {27800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {27766#true} assume true; {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27766#true} {27766#true} #58#return; {27766#true} is VALID [2022-04-15 12:29:57,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {27766#true} call #t~ret8 := main(); {27766#true} is VALID [2022-04-15 12:29:57,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {27766#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; {27771#(= main_~i~0 0)} is VALID [2022-04-15 12:29:57,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {27771#(= 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; {27771#(= main_~i~0 0)} is VALID [2022-04-15 12:29:57,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {27771#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:57,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {27772#(<= 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; {27772#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:57,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {27772#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:57,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {27773#(<= 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; {27773#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:57,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {27773#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:57,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {27774#(<= 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; {27774#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:57,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {27774#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:57,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {27775#(<= 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; {27775#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:57,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {27775#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:57,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {27776#(<= 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; {27776#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:57,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {27776#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:57,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {27777#(<= 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; {27777#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:57,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {27777#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:57,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {27778#(<= 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; {27778#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:57,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {27778#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:57,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {27779#(<= 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; {27779#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:57,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {27779#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:57,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {27780#(<= 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; {27780#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:57,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {27780#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:57,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {27781#(<= 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; {27781#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:57,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {27781#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:57,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {27782#(<= 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; {27782#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:57,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {27782#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:57,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {27783#(<= 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; {27783#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:57,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {27783#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:57,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {27784#(<= 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; {27784#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:57,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {27784#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:57,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {27785#(<= 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; {27785#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:57,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {27785#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:57,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {27786#(<= 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; {27786#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:57,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {27786#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:57,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {27787#(<= 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; {27787#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:57,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {27787#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:57,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {27788#(<= 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; {27788#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:57,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {27788#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:57,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {27789#(<= 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; {27789#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:57,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {27789#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:57,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {27790#(<= 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; {27790#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:57,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {27790#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:57,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {27791#(<= 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; {27791#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:57,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {27791#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:57,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {27792#(<= 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; {27792#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:57,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {27792#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:57,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {27793#(<= 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; {27793#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:57,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {27793#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:57,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {27794#(<= 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; {27794#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:57,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {27794#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:57,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {27795#(<= 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; {27795#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:57,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {27795#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:57,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {27796#(<= 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; {27796#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:57,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {27796#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:57,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {27797#(<= 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; {27797#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:57,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {27797#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 27)} is VALID [2022-04-15 12:29:57,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {27798#(<= 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; {27798#(<= main_~i~0 27)} is VALID [2022-04-15 12:29:57,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {27798#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 28)} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {27799#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {27767#false} ~i~0 := 0; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 75: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 90: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 91: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 92: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 93: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 94: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 95: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 96: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 97: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 98: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 102: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,244 INFO L290 TraceCheckUtils]: 103: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 104: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 105: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 106: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 107: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 108: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 109: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 110: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 111: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 112: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 113: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 114: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 115: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 116: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 117: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,245 INFO L290 TraceCheckUtils]: 118: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 119: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 120: Hoare triple {27767#false} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 121: Hoare triple {27767#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); {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L272 TraceCheckUtils]: 122: Hoare triple {27767#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 123: Hoare triple {27767#false} ~cond := #in~cond; {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 124: Hoare triple {27767#false} assume 0 == ~cond; {27767#false} is VALID [2022-04-15 12:29:57,246 INFO L290 TraceCheckUtils]: 125: Hoare triple {27767#false} assume !false; {27767#false} is VALID [2022-04-15 12:29:57,247 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-15 12:29:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:57,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587081347] [2022-04-15 12:29:57,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587081347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:29:57,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284844486] [2022-04-15 12:29:57,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:29:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:29:57,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:29:57,248 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:29:57,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:29:57,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:29:57,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:29:57,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:29:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:57,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:29:58,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {27766#true} call ULTIMATE.init(); {27766#true} is VALID [2022-04-15 12:29:58,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {27766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27766#true} is VALID [2022-04-15 12:29:58,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {27766#true} assume true; {27766#true} is VALID [2022-04-15 12:29:58,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27766#true} {27766#true} #58#return; {27766#true} is VALID [2022-04-15 12:29:58,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {27766#true} call #t~ret8 := main(); {27766#true} is VALID [2022-04-15 12:29:58,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {27766#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; {27819#(<= main_~i~0 0)} is VALID [2022-04-15 12:29:58,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {27819#(<= 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; {27819#(<= main_~i~0 0)} is VALID [2022-04-15 12:29:58,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {27819#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:58,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {27772#(<= 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; {27772#(<= main_~i~0 1)} is VALID [2022-04-15 12:29:58,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {27772#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:58,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {27773#(<= 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; {27773#(<= main_~i~0 2)} is VALID [2022-04-15 12:29:58,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {27773#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:58,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {27774#(<= 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; {27774#(<= main_~i~0 3)} is VALID [2022-04-15 12:29:58,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {27774#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:58,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {27775#(<= 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; {27775#(<= main_~i~0 4)} is VALID [2022-04-15 12:29:58,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {27775#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:58,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {27776#(<= 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; {27776#(<= main_~i~0 5)} is VALID [2022-04-15 12:29:58,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {27776#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:58,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {27777#(<= 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; {27777#(<= main_~i~0 6)} is VALID [2022-04-15 12:29:58,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {27777#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:58,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {27778#(<= 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; {27778#(<= main_~i~0 7)} is VALID [2022-04-15 12:29:58,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {27778#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:58,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {27779#(<= 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; {27779#(<= main_~i~0 8)} is VALID [2022-04-15 12:29:58,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {27779#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:58,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {27780#(<= 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; {27780#(<= main_~i~0 9)} is VALID [2022-04-15 12:29:58,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {27780#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:58,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {27781#(<= 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; {27781#(<= main_~i~0 10)} is VALID [2022-04-15 12:29:58,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {27781#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:58,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {27782#(<= 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; {27782#(<= main_~i~0 11)} is VALID [2022-04-15 12:29:58,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {27782#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:58,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {27783#(<= 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; {27783#(<= main_~i~0 12)} is VALID [2022-04-15 12:29:58,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {27783#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:58,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {27784#(<= 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; {27784#(<= main_~i~0 13)} is VALID [2022-04-15 12:29:58,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {27784#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:58,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {27785#(<= 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; {27785#(<= main_~i~0 14)} is VALID [2022-04-15 12:29:58,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {27785#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:58,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {27786#(<= 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; {27786#(<= main_~i~0 15)} is VALID [2022-04-15 12:29:58,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {27786#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:58,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {27787#(<= 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; {27787#(<= main_~i~0 16)} is VALID [2022-04-15 12:29:58,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {27787#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:58,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {27788#(<= 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; {27788#(<= main_~i~0 17)} is VALID [2022-04-15 12:29:58,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {27788#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:58,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {27789#(<= 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; {27789#(<= main_~i~0 18)} is VALID [2022-04-15 12:29:58,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {27789#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:58,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {27790#(<= 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; {27790#(<= main_~i~0 19)} is VALID [2022-04-15 12:29:58,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {27790#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:58,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {27791#(<= 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; {27791#(<= main_~i~0 20)} is VALID [2022-04-15 12:29:58,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {27791#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:58,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {27792#(<= 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; {27792#(<= main_~i~0 21)} is VALID [2022-04-15 12:29:58,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {27792#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:58,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {27793#(<= 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; {27793#(<= main_~i~0 22)} is VALID [2022-04-15 12:29:58,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {27793#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:58,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {27794#(<= 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; {27794#(<= main_~i~0 23)} is VALID [2022-04-15 12:29:58,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {27794#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:58,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {27795#(<= 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; {27795#(<= main_~i~0 24)} is VALID [2022-04-15 12:29:58,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {27795#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:58,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {27796#(<= 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; {27796#(<= main_~i~0 25)} is VALID [2022-04-15 12:29:58,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {27796#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:58,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {27797#(<= 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; {27797#(<= main_~i~0 26)} is VALID [2022-04-15 12:29:58,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {27797#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 27)} is VALID [2022-04-15 12:29:58,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {27798#(<= 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; {27798#(<= main_~i~0 27)} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {27798#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 28)} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {27799#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {27767#false} ~i~0 := 0; {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 72: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 73: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 83: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 85: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 86: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 87: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 98: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 99: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 100: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 101: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 102: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 103: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 104: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 105: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 106: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 107: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 108: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 109: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 110: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,106 INFO L290 TraceCheckUtils]: 112: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 113: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 115: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 116: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 117: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 119: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 120: Hoare triple {27767#false} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 121: Hoare triple {27767#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); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L272 TraceCheckUtils]: 122: Hoare triple {27767#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 123: Hoare triple {27767#false} ~cond := #in~cond; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 124: Hoare triple {27767#false} assume 0 == ~cond; {27767#false} is VALID [2022-04-15 12:29:58,107 INFO L290 TraceCheckUtils]: 125: Hoare triple {27767#false} assume !false; {27767#false} is VALID [2022-04-15 12:29:58,108 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-15 12:29:58,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:29:59,244 INFO L290 TraceCheckUtils]: 125: Hoare triple {27767#false} assume !false; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 124: Hoare triple {27767#false} assume 0 == ~cond; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 123: Hoare triple {27767#false} ~cond := #in~cond; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L272 TraceCheckUtils]: 122: Hoare triple {27767#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 121: Hoare triple {27767#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); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 120: Hoare triple {27767#false} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 119: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 118: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 117: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 116: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 115: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 114: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 113: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,245 INFO L290 TraceCheckUtils]: 112: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 111: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 110: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 109: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 108: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 107: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 106: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 105: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 104: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 103: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 102: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 101: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 100: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 99: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 98: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,246 INFO L290 TraceCheckUtils]: 97: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 95: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 90: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 85: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 84: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 80: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 76: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 75: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 71: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {27767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {27767#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {27767#false} ~i~0 := 0; {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {28369#(< main_~i~0 2048)} assume !(~i~0 < 2048); {27767#false} is VALID [2022-04-15 12:29:59,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {28373#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28369#(< main_~i~0 2048)} is VALID [2022-04-15 12:29:59,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {28373#(< 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; {28373#(< main_~i~0 2047)} is VALID [2022-04-15 12:29:59,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {28380#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28373#(< main_~i~0 2047)} is VALID [2022-04-15 12:29:59,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {28380#(< 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; {28380#(< main_~i~0 2046)} is VALID [2022-04-15 12:29:59,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {28387#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28380#(< main_~i~0 2046)} is VALID [2022-04-15 12:29:59,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {28387#(< 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; {28387#(< main_~i~0 2045)} is VALID [2022-04-15 12:29:59,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {28394#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28387#(< main_~i~0 2045)} is VALID [2022-04-15 12:29:59,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {28394#(< 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; {28394#(< main_~i~0 2044)} is VALID [2022-04-15 12:29:59,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {28401#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28394#(< main_~i~0 2044)} is VALID [2022-04-15 12:29:59,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {28401#(< 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; {28401#(< main_~i~0 2043)} is VALID [2022-04-15 12:29:59,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {28408#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28401#(< main_~i~0 2043)} is VALID [2022-04-15 12:29:59,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {28408#(< 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; {28408#(< main_~i~0 2042)} is VALID [2022-04-15 12:29:59,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {28415#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28408#(< main_~i~0 2042)} is VALID [2022-04-15 12:29:59,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {28415#(< 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; {28415#(< main_~i~0 2041)} is VALID [2022-04-15 12:29:59,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {28422#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28415#(< main_~i~0 2041)} is VALID [2022-04-15 12:29:59,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {28422#(< 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; {28422#(< main_~i~0 2040)} is VALID [2022-04-15 12:29:59,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {28429#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28422#(< main_~i~0 2040)} is VALID [2022-04-15 12:29:59,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {28429#(< 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; {28429#(< main_~i~0 2039)} is VALID [2022-04-15 12:29:59,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {28436#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28429#(< main_~i~0 2039)} is VALID [2022-04-15 12:29:59,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {28436#(< 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; {28436#(< main_~i~0 2038)} is VALID [2022-04-15 12:29:59,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {28443#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28436#(< main_~i~0 2038)} is VALID [2022-04-15 12:29:59,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {28443#(< 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; {28443#(< main_~i~0 2037)} is VALID [2022-04-15 12:29:59,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {28450#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28443#(< main_~i~0 2037)} is VALID [2022-04-15 12:29:59,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {28450#(< 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; {28450#(< main_~i~0 2036)} is VALID [2022-04-15 12:29:59,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {28457#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28450#(< main_~i~0 2036)} is VALID [2022-04-15 12:29:59,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {28457#(< 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; {28457#(< main_~i~0 2035)} is VALID [2022-04-15 12:29:59,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {28464#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28457#(< main_~i~0 2035)} is VALID [2022-04-15 12:29:59,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {28464#(< 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; {28464#(< main_~i~0 2034)} is VALID [2022-04-15 12:29:59,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {28471#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28464#(< main_~i~0 2034)} is VALID [2022-04-15 12:29:59,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {28471#(< 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; {28471#(< main_~i~0 2033)} is VALID [2022-04-15 12:29:59,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {28478#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28471#(< main_~i~0 2033)} is VALID [2022-04-15 12:29:59,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {28478#(< 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; {28478#(< main_~i~0 2032)} is VALID [2022-04-15 12:29:59,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {28485#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28478#(< main_~i~0 2032)} is VALID [2022-04-15 12:29:59,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {28485#(< 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; {28485#(< main_~i~0 2031)} is VALID [2022-04-15 12:29:59,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {28492#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28485#(< main_~i~0 2031)} is VALID [2022-04-15 12:29:59,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {28492#(< 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; {28492#(< main_~i~0 2030)} is VALID [2022-04-15 12:29:59,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {28499#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28492#(< main_~i~0 2030)} is VALID [2022-04-15 12:29:59,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {28499#(< 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; {28499#(< main_~i~0 2029)} is VALID [2022-04-15 12:29:59,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {28506#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28499#(< main_~i~0 2029)} is VALID [2022-04-15 12:29:59,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {28506#(< 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; {28506#(< main_~i~0 2028)} is VALID [2022-04-15 12:29:59,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {28513#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28506#(< main_~i~0 2028)} is VALID [2022-04-15 12:29:59,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {28513#(< 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; {28513#(< main_~i~0 2027)} is VALID [2022-04-15 12:29:59,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {28520#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28513#(< main_~i~0 2027)} is VALID [2022-04-15 12:29:59,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {28520#(< 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; {28520#(< main_~i~0 2026)} is VALID [2022-04-15 12:29:59,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {28527#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28520#(< main_~i~0 2026)} is VALID [2022-04-15 12:29:59,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {28527#(< 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; {28527#(< main_~i~0 2025)} is VALID [2022-04-15 12:29:59,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {28534#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28527#(< main_~i~0 2025)} is VALID [2022-04-15 12:29:59,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {28534#(< 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; {28534#(< main_~i~0 2024)} is VALID [2022-04-15 12:29:59,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {28541#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28534#(< main_~i~0 2024)} is VALID [2022-04-15 12:29:59,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {28541#(< 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; {28541#(< main_~i~0 2023)} is VALID [2022-04-15 12:29:59,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {28548#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28541#(< main_~i~0 2023)} is VALID [2022-04-15 12:29:59,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {28548#(< 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; {28548#(< main_~i~0 2022)} is VALID [2022-04-15 12:29:59,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {28555#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28548#(< main_~i~0 2022)} is VALID [2022-04-15 12:29:59,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {28555#(< 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; {28555#(< main_~i~0 2021)} is VALID [2022-04-15 12:29:59,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {28562#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28555#(< main_~i~0 2021)} is VALID [2022-04-15 12:29:59,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {28562#(< 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; {28562#(< main_~i~0 2020)} is VALID [2022-04-15 12:29:59,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {27766#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; {28562#(< main_~i~0 2020)} is VALID [2022-04-15 12:29:59,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {27766#true} call #t~ret8 := main(); {27766#true} is VALID [2022-04-15 12:29:59,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27766#true} {27766#true} #58#return; {27766#true} is VALID [2022-04-15 12:29:59,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {27766#true} assume true; {27766#true} is VALID [2022-04-15 12:29:59,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {27766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27766#true} is VALID [2022-04-15 12:29:59,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {27766#true} call ULTIMATE.init(); {27766#true} is VALID [2022-04-15 12:29:59,267 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-15 12:29:59,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284844486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:29:59,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:29:59,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 12:29:59,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:59,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677594820] [2022-04-15 12:29:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677594820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:59,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:29:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773956850] [2022-04-15 12:29:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:59,268 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-15 12:29:59,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:59,269 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-15 12:29:59,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:59,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:29:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:29:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:29:59,313 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-15 12:30:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:00,431 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2022-04-15 12:30:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:30:00,431 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-15 12:30:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:00,432 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-15 12:30:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-15 12:30:00,438 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-15 12:30:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-15 12:30:00,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 145 transitions. [2022-04-15 12:30:00,538 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-15 12:30:00,540 INFO L225 Difference]: With dead ends: 197 [2022-04-15 12:30:00,540 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 12:30:00,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:30:00,541 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:00,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 31 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:30:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 12:30:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-15 12:30:00,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:00,866 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-15 12:30:00,866 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-15 12:30:00,866 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-15 12:30:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:00,867 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-15 12:30:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 12:30:00,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:00,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:00,868 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-15 12:30:00,869 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-15 12:30:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:00,870 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-15 12:30:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 12:30:00,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:00,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:00,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:00,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:00,870 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-15 12:30:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-04-15 12:30:00,871 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-04-15 12:30:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:00,871 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-04-15 12:30:00,871 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-15 12:30:00,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 132 transitions. [2022-04-15 12:30:01,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 12:30:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 12:30:01,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:01,003 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-15 12:30:01,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:30:01,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:30:01,204 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 57 times [2022-04-15 12:30:01,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:01,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708538688] [2022-04-15 12:30:01,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:30:01,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:30:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 58 times [2022-04-15 12:30:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081846992] [2022-04-15 12:30:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:01,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {29601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {29566#true} assume true; {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29566#true} {29566#true} #58#return; {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {29566#true} call ULTIMATE.init(); {29601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:01,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {29601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {29566#true} assume true; {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29566#true} {29566#true} #58#return; {29566#true} is VALID [2022-04-15 12:30:01,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {29566#true} call #t~ret8 := main(); {29566#true} is VALID [2022-04-15 12:30:01,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {29566#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; {29571#(= main_~i~0 0)} is VALID [2022-04-15 12:30:01,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {29571#(= 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; {29571#(= main_~i~0 0)} is VALID [2022-04-15 12:30:01,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {29571#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29572#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:01,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {29572#(<= 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; {29572#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:01,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {29572#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:01,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {29573#(<= 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; {29573#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:01,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {29573#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:01,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {29574#(<= 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; {29574#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:01,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {29574#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:01,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {29575#(<= 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; {29575#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:01,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {29575#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:01,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {29576#(<= 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; {29576#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:01,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {29576#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:01,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {29577#(<= 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; {29577#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:01,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {29577#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:01,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {29578#(<= 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; {29578#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:01,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {29578#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:01,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {29579#(<= 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; {29579#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:01,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {29579#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:01,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {29580#(<= 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; {29580#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:01,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {29580#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:01,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {29581#(<= 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; {29581#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:01,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {29581#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:01,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {29582#(<= 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; {29582#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:01,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {29582#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:01,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {29583#(<= 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; {29583#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:01,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {29583#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:01,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {29584#(<= 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; {29584#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:01,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {29584#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:01,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {29585#(<= 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; {29585#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:01,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {29585#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:01,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {29586#(<= 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; {29586#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:01,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {29586#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:01,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {29587#(<= 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; {29587#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:01,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {29587#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:01,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {29588#(<= 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; {29588#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:01,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {29588#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:01,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {29589#(<= 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; {29589#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:01,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {29589#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:01,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {29590#(<= 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; {29590#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:01,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {29590#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:01,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {29591#(<= 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; {29591#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:01,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {29591#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:01,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {29592#(<= 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; {29592#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:01,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {29592#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:01,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {29593#(<= 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; {29593#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:01,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {29593#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:01,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {29594#(<= 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; {29594#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:01,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {29594#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:01,650 INFO L290 TraceCheckUtils]: 54: Hoare triple {29595#(<= 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; {29595#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:01,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {29595#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:01,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {29596#(<= 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; {29596#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:01,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {29596#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:01,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {29597#(<= 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; {29597#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:01,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {29597#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:01,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {29598#(<= 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; {29598#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:01,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {29598#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {29599#(<= 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; {29599#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {29599#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 29)} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {29600#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {29567#false} ~i~0 := 0; {29567#false} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 79: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 81: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 82: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,654 INFO L290 TraceCheckUtils]: 83: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 87: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 91: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 92: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 93: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 94: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 95: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 104: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 105: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 106: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 107: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 108: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 109: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 110: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 111: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 112: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,656 INFO L290 TraceCheckUtils]: 113: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 114: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 115: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 116: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 117: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 118: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 119: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 120: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 121: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 122: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 123: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 124: Hoare triple {29567#false} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 125: Hoare triple {29567#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); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L272 TraceCheckUtils]: 126: Hoare triple {29567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {29567#false} is VALID [2022-04-15 12:30:01,657 INFO L290 TraceCheckUtils]: 127: Hoare triple {29567#false} ~cond := #in~cond; {29567#false} is VALID [2022-04-15 12:30:01,658 INFO L290 TraceCheckUtils]: 128: Hoare triple {29567#false} assume 0 == ~cond; {29567#false} is VALID [2022-04-15 12:30:01,658 INFO L290 TraceCheckUtils]: 129: Hoare triple {29567#false} assume !false; {29567#false} is VALID [2022-04-15 12:30:01,658 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-15 12:30:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:01,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081846992] [2022-04-15 12:30:01,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081846992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:30:01,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435568298] [2022-04-15 12:30:01,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:30:01,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:30:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:30:01,660 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:30:01,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:30:02,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:30:02,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:30:02,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:30:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:02,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:30:02,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {29566#true} call ULTIMATE.init(); {29566#true} is VALID [2022-04-15 12:30:02,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {29566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29566#true} is VALID [2022-04-15 12:30:02,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {29566#true} assume true; {29566#true} is VALID [2022-04-15 12:30:02,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29566#true} {29566#true} #58#return; {29566#true} is VALID [2022-04-15 12:30:02,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {29566#true} call #t~ret8 := main(); {29566#true} is VALID [2022-04-15 12:30:02,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {29566#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; {29620#(<= main_~i~0 0)} is VALID [2022-04-15 12:30:02,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {29620#(<= 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; {29620#(<= main_~i~0 0)} is VALID [2022-04-15 12:30:02,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {29620#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29572#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:02,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {29572#(<= 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; {29572#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:02,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {29572#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:02,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {29573#(<= 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; {29573#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:02,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {29573#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:02,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {29574#(<= 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; {29574#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:02,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {29574#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:02,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {29575#(<= 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; {29575#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:02,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {29575#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:02,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {29576#(<= 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; {29576#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:02,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {29576#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:02,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {29577#(<= 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; {29577#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:02,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {29577#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:02,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {29578#(<= 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; {29578#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:02,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {29578#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:02,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {29579#(<= 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; {29579#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:02,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {29579#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:02,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {29580#(<= 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; {29580#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:02,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {29580#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:02,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {29581#(<= 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; {29581#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:02,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {29581#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:02,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {29582#(<= 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; {29582#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:02,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {29582#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:02,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {29583#(<= 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; {29583#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:02,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {29583#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:02,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {29584#(<= 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; {29584#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:02,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {29584#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:02,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {29585#(<= 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; {29585#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:02,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {29585#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:02,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {29586#(<= 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; {29586#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:02,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {29586#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:02,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {29587#(<= 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; {29587#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:02,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {29587#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:02,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {29588#(<= 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; {29588#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:02,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {29588#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:02,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {29589#(<= 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; {29589#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:02,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {29589#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:02,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {29590#(<= 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; {29590#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:02,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {29590#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:02,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {29591#(<= 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; {29591#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:02,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {29591#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:02,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {29592#(<= 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; {29592#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:02,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {29592#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:02,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {29593#(<= 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; {29593#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:02,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {29593#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:02,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {29594#(<= 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; {29594#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:02,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {29594#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:02,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {29595#(<= 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; {29595#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:02,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {29595#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:02,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {29596#(<= 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; {29596#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:02,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {29596#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:02,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {29597#(<= 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; {29597#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:02,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {29597#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:02,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {29598#(<= 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; {29598#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:02,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {29598#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:02,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {29599#(<= 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; {29599#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:02,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {29599#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 29)} is VALID [2022-04-15 12:30:02,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {29600#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:02,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {29567#false} ~i~0 := 0; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 81: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 82: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 95: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 96: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 97: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 99: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 103: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 104: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 105: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 107: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,509 INFO L290 TraceCheckUtils]: 108: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 111: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 113: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 114: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 115: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 117: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 119: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 120: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 121: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 122: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:02,510 INFO L290 TraceCheckUtils]: 123: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L290 TraceCheckUtils]: 124: Hoare triple {29567#false} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L290 TraceCheckUtils]: 125: Hoare triple {29567#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); {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L272 TraceCheckUtils]: 126: Hoare triple {29567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L290 TraceCheckUtils]: 127: Hoare triple {29567#false} ~cond := #in~cond; {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L290 TraceCheckUtils]: 128: Hoare triple {29567#false} assume 0 == ~cond; {29567#false} is VALID [2022-04-15 12:30:02,511 INFO L290 TraceCheckUtils]: 129: Hoare triple {29567#false} assume !false; {29567#false} is VALID [2022-04-15 12:30:02,511 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-15 12:30:02,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:30:03,688 INFO L290 TraceCheckUtils]: 129: Hoare triple {29567#false} assume !false; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 128: Hoare triple {29567#false} assume 0 == ~cond; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 127: Hoare triple {29567#false} ~cond := #in~cond; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L272 TraceCheckUtils]: 126: Hoare triple {29567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 125: Hoare triple {29567#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); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 124: Hoare triple {29567#false} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 123: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 122: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 121: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 120: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 119: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,689 INFO L290 TraceCheckUtils]: 117: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 116: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 115: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 114: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 113: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 112: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 111: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 110: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 109: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 108: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 107: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 106: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 105: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 104: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,690 INFO L290 TraceCheckUtils]: 103: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 100: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 99: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 98: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 95: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 94: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 91: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 87: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 76: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {29567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {29567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {29567#false} ~i~0 := 0; {29567#false} is VALID [2022-04-15 12:30:03,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {30188#(< main_~i~0 2048)} assume !(~i~0 < 2048); {29567#false} is VALID [2022-04-15 12:30:03,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {30192#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30188#(< main_~i~0 2048)} is VALID [2022-04-15 12:30:03,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {30192#(< 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; {30192#(< main_~i~0 2047)} is VALID [2022-04-15 12:30:03,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {30199#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30192#(< main_~i~0 2047)} is VALID [2022-04-15 12:30:03,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {30199#(< 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; {30199#(< main_~i~0 2046)} is VALID [2022-04-15 12:30:03,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {30206#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30199#(< main_~i~0 2046)} is VALID [2022-04-15 12:30:03,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {30206#(< 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; {30206#(< main_~i~0 2045)} is VALID [2022-04-15 12:30:03,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {30213#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30206#(< main_~i~0 2045)} is VALID [2022-04-15 12:30:03,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {30213#(< 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; {30213#(< main_~i~0 2044)} is VALID [2022-04-15 12:30:03,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {30220#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30213#(< main_~i~0 2044)} is VALID [2022-04-15 12:30:03,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {30220#(< 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; {30220#(< main_~i~0 2043)} is VALID [2022-04-15 12:30:03,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {30227#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30220#(< main_~i~0 2043)} is VALID [2022-04-15 12:30:03,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {30227#(< 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; {30227#(< main_~i~0 2042)} is VALID [2022-04-15 12:30:03,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {30234#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30227#(< main_~i~0 2042)} is VALID [2022-04-15 12:30:03,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {30234#(< 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; {30234#(< main_~i~0 2041)} is VALID [2022-04-15 12:30:03,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {30241#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30234#(< main_~i~0 2041)} is VALID [2022-04-15 12:30:03,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {30241#(< 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; {30241#(< main_~i~0 2040)} is VALID [2022-04-15 12:30:03,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {30248#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30241#(< main_~i~0 2040)} is VALID [2022-04-15 12:30:03,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {30248#(< 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; {30248#(< main_~i~0 2039)} is VALID [2022-04-15 12:30:03,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {30255#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30248#(< main_~i~0 2039)} is VALID [2022-04-15 12:30:03,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {30255#(< 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; {30255#(< main_~i~0 2038)} is VALID [2022-04-15 12:30:03,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {30262#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30255#(< main_~i~0 2038)} is VALID [2022-04-15 12:30:03,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {30262#(< 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; {30262#(< main_~i~0 2037)} is VALID [2022-04-15 12:30:03,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {30269#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30262#(< main_~i~0 2037)} is VALID [2022-04-15 12:30:03,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {30269#(< 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; {30269#(< main_~i~0 2036)} is VALID [2022-04-15 12:30:03,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {30276#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30269#(< main_~i~0 2036)} is VALID [2022-04-15 12:30:03,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {30276#(< 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; {30276#(< main_~i~0 2035)} is VALID [2022-04-15 12:30:03,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {30283#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30276#(< main_~i~0 2035)} is VALID [2022-04-15 12:30:03,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {30283#(< 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; {30283#(< main_~i~0 2034)} is VALID [2022-04-15 12:30:03,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {30290#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30283#(< main_~i~0 2034)} is VALID [2022-04-15 12:30:03,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {30290#(< 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; {30290#(< main_~i~0 2033)} is VALID [2022-04-15 12:30:03,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {30297#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30290#(< main_~i~0 2033)} is VALID [2022-04-15 12:30:03,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {30297#(< 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; {30297#(< main_~i~0 2032)} is VALID [2022-04-15 12:30:03,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {30304#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30297#(< main_~i~0 2032)} is VALID [2022-04-15 12:30:03,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {30304#(< 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; {30304#(< main_~i~0 2031)} is VALID [2022-04-15 12:30:03,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {30311#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30304#(< main_~i~0 2031)} is VALID [2022-04-15 12:30:03,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {30311#(< 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; {30311#(< main_~i~0 2030)} is VALID [2022-04-15 12:30:03,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {30318#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30311#(< main_~i~0 2030)} is VALID [2022-04-15 12:30:03,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {30318#(< 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; {30318#(< main_~i~0 2029)} is VALID [2022-04-15 12:30:03,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {30325#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30318#(< main_~i~0 2029)} is VALID [2022-04-15 12:30:03,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {30325#(< 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; {30325#(< main_~i~0 2028)} is VALID [2022-04-15 12:30:03,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {30332#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30325#(< main_~i~0 2028)} is VALID [2022-04-15 12:30:03,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {30332#(< 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; {30332#(< main_~i~0 2027)} is VALID [2022-04-15 12:30:03,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {30339#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30332#(< main_~i~0 2027)} is VALID [2022-04-15 12:30:03,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {30339#(< 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; {30339#(< main_~i~0 2026)} is VALID [2022-04-15 12:30:03,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {30346#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30339#(< main_~i~0 2026)} is VALID [2022-04-15 12:30:03,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {30346#(< 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; {30346#(< main_~i~0 2025)} is VALID [2022-04-15 12:30:03,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {30353#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30346#(< main_~i~0 2025)} is VALID [2022-04-15 12:30:03,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {30353#(< 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; {30353#(< main_~i~0 2024)} is VALID [2022-04-15 12:30:03,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {30360#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30353#(< main_~i~0 2024)} is VALID [2022-04-15 12:30:03,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {30360#(< 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; {30360#(< main_~i~0 2023)} is VALID [2022-04-15 12:30:03,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {30367#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30360#(< main_~i~0 2023)} is VALID [2022-04-15 12:30:03,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {30367#(< 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; {30367#(< main_~i~0 2022)} is VALID [2022-04-15 12:30:03,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {30374#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30367#(< main_~i~0 2022)} is VALID [2022-04-15 12:30:03,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {30374#(< 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; {30374#(< main_~i~0 2021)} is VALID [2022-04-15 12:30:03,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {30381#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30374#(< main_~i~0 2021)} is VALID [2022-04-15 12:30:03,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {30381#(< 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; {30381#(< main_~i~0 2020)} is VALID [2022-04-15 12:30:03,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {30388#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30381#(< main_~i~0 2020)} is VALID [2022-04-15 12:30:03,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {30388#(< 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; {30388#(< main_~i~0 2019)} is VALID [2022-04-15 12:30:03,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {29566#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; {30388#(< main_~i~0 2019)} is VALID [2022-04-15 12:30:03,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {29566#true} call #t~ret8 := main(); {29566#true} is VALID [2022-04-15 12:30:03,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29566#true} {29566#true} #58#return; {29566#true} is VALID [2022-04-15 12:30:03,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {29566#true} assume true; {29566#true} is VALID [2022-04-15 12:30:03,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {29566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29566#true} is VALID [2022-04-15 12:30:03,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {29566#true} call ULTIMATE.init(); {29566#true} is VALID [2022-04-15 12:30:03,719 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-15 12:30:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435568298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:30:03,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:30:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 12:30:03,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:03,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708538688] [2022-04-15 12:30:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708538688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:03,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:30:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755486983] [2022-04-15 12:30:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:03,721 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-15 12:30:03,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:03,721 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-15 12:30:03,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:03,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:30:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:30:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:30:03,765 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-15 12:30:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:04,907 INFO L93 Difference]: Finished difference Result 203 states and 206 transitions. [2022-04-15 12:30:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:30:04,907 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-15 12:30:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:04,907 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-15 12:30:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 12:30:04,908 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-15 12:30:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 12:30:04,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 149 transitions. [2022-04-15 12:30:05,009 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-15 12:30:05,010 INFO L225 Difference]: With dead ends: 203 [2022-04-15 12:30:05,010 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 12:30:05,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 12:30:05,016 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 198 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:05,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 31 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:30:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 12:30:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 12:30:05,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:05,368 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-15 12:30:05,368 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-15 12:30:05,368 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-15 12:30:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:05,369 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 12:30:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:30:05,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:05,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:05,370 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-15 12:30:05,370 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-15 12:30:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:05,371 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 12:30:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:30:05,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:05,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:05,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:05,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:05,372 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-15 12:30:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-04-15 12:30:05,373 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2022-04-15 12:30:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:05,373 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-04-15 12:30:05,374 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-15 12:30:05,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 136 transitions. [2022-04-15 12:30:05,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-04-15 12:30:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 12:30:05,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:05,511 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-15 12:30:05,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:30:05,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:30:05,716 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 59 times [2022-04-15 12:30:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172850285] [2022-04-15 12:30:05,722 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:30:05,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:30:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 60 times [2022-04-15 12:30:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:05,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804414981] [2022-04-15 12:30:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:06,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {31458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {31422#true} assume true; {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31422#true} {31422#true} #58#return; {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {31422#true} call ULTIMATE.init(); {31458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:06,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {31458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {31422#true} assume true; {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31422#true} {31422#true} #58#return; {31422#true} is VALID [2022-04-15 12:30:06,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {31422#true} call #t~ret8 := main(); {31422#true} is VALID [2022-04-15 12:30:06,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {31422#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; {31427#(= main_~i~0 0)} is VALID [2022-04-15 12:30:06,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {31427#(= 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; {31427#(= main_~i~0 0)} is VALID [2022-04-15 12:30:06,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {31427#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31428#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:06,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {31428#(<= 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; {31428#(<= main_~i~0 1)} is VALID [2022-04-15 12:30:06,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {31428#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31429#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:06,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {31429#(<= 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; {31429#(<= main_~i~0 2)} is VALID [2022-04-15 12:30:06,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {31429#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31430#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:06,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {31430#(<= 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; {31430#(<= main_~i~0 3)} is VALID [2022-04-15 12:30:06,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {31430#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31431#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:06,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {31431#(<= 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; {31431#(<= main_~i~0 4)} is VALID [2022-04-15 12:30:06,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {31431#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31432#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:06,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {31432#(<= 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; {31432#(<= main_~i~0 5)} is VALID [2022-04-15 12:30:06,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {31432#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31433#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:06,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {31433#(<= 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; {31433#(<= main_~i~0 6)} is VALID [2022-04-15 12:30:06,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {31433#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31434#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:06,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {31434#(<= 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; {31434#(<= main_~i~0 7)} is VALID [2022-04-15 12:30:06,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {31434#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31435#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:06,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {31435#(<= 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; {31435#(<= main_~i~0 8)} is VALID [2022-04-15 12:30:06,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {31435#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31436#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:06,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {31436#(<= 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; {31436#(<= main_~i~0 9)} is VALID [2022-04-15 12:30:06,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {31436#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31437#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:06,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {31437#(<= 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; {31437#(<= main_~i~0 10)} is VALID [2022-04-15 12:30:06,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {31437#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31438#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:06,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {31438#(<= 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; {31438#(<= main_~i~0 11)} is VALID [2022-04-15 12:30:06,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {31438#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31439#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:06,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {31439#(<= 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; {31439#(<= main_~i~0 12)} is VALID [2022-04-15 12:30:06,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {31439#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:06,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {31440#(<= 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; {31440#(<= main_~i~0 13)} is VALID [2022-04-15 12:30:06,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {31440#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31441#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:06,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {31441#(<= 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; {31441#(<= main_~i~0 14)} is VALID [2022-04-15 12:30:06,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {31441#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31442#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:06,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {31442#(<= 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; {31442#(<= main_~i~0 15)} is VALID [2022-04-15 12:30:06,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {31442#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31443#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:06,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {31443#(<= 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; {31443#(<= main_~i~0 16)} is VALID [2022-04-15 12:30:06,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {31443#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:06,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {31444#(<= 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; {31444#(<= main_~i~0 17)} is VALID [2022-04-15 12:30:06,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {31444#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31445#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:06,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {31445#(<= 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; {31445#(<= main_~i~0 18)} is VALID [2022-04-15 12:30:06,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {31445#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31446#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:06,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {31446#(<= 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; {31446#(<= main_~i~0 19)} is VALID [2022-04-15 12:30:06,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {31446#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31447#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:06,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {31447#(<= 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; {31447#(<= main_~i~0 20)} is VALID [2022-04-15 12:30:06,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {31447#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31448#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:06,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {31448#(<= 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; {31448#(<= main_~i~0 21)} is VALID [2022-04-15 12:30:06,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {31448#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31449#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:06,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {31449#(<= 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; {31449#(<= main_~i~0 22)} is VALID [2022-04-15 12:30:06,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {31449#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31450#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:06,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {31450#(<= 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; {31450#(<= main_~i~0 23)} is VALID [2022-04-15 12:30:06,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {31450#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:06,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {31451#(<= 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; {31451#(<= main_~i~0 24)} is VALID [2022-04-15 12:30:06,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {31451#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31452#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:06,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {31452#(<= 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; {31452#(<= main_~i~0 25)} is VALID [2022-04-15 12:30:06,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {31452#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31453#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:06,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {31453#(<= 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; {31453#(<= main_~i~0 26)} is VALID [2022-04-15 12:30:06,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {31453#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31454#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:06,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {31454#(<= 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; {31454#(<= main_~i~0 27)} is VALID [2022-04-15 12:30:06,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {31454#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31455#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:06,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {31455#(<= 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; {31455#(<= main_~i~0 28)} is VALID [2022-04-15 12:30:06,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {31455#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31456#(<= main_~i~0 29)} is VALID [2022-04-15 12:30:06,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {31456#(<= 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; {31456#(<= main_~i~0 29)} is VALID [2022-04-15 12:30:06,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {31456#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31457#(<= main_~i~0 30)} is VALID [2022-04-15 12:30:06,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {31457#(<= main_~i~0 30)} assume !(~i~0 < 2048); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {31423#false} ~i~0 := 0; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 77: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 78: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 79: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,187 INFO L290 TraceCheckUtils]: 80: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 81: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 82: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 83: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 84: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 85: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 86: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 87: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 89: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 90: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 94: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,188 INFO L290 TraceCheckUtils]: 95: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 96: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 97: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 99: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 101: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 102: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 103: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 104: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 105: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 106: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 107: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,189 INFO L290 TraceCheckUtils]: 110: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 111: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 112: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 113: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 114: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 115: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 116: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 117: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 118: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 119: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 120: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 121: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 122: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 123: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 124: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,190 INFO L290 TraceCheckUtils]: 125: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 126: Hoare triple {31423#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 127: Hoare triple {31423#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 128: Hoare triple {31423#false} assume !(~i~0 < 2048); {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 129: Hoare triple {31423#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); {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L272 TraceCheckUtils]: 130: Hoare triple {31423#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 131: Hoare triple {31423#false} ~cond := #in~cond; {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 132: Hoare triple {31423#false} assume 0 == ~cond; {31423#false} is VALID [2022-04-15 12:30:06,191 INFO L290 TraceCheckUtils]: 133: Hoare triple {31423#false} assume !false; {31423#false} is VALID [2022-04-15 12:30:06,192 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-15 12:30:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804414981] [2022-04-15 12:30:06,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804414981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:30:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762291132] [2022-04-15 12:30:06,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:30:06,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:30:06,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:30:06,193 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:30:06,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process