/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:30:12,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:30:12,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:30:13,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:30:13,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:30:13,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:30:13,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:30:13,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:30:13,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:30:13,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:30:13,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:30:13,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:30:13,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:30:13,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:30:13,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:30:13,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:30:13,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:30:13,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:30:13,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:30:13,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:30:13,051 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:30:13,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:30:13,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:30:13,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:30:13,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:30:13,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:30:13,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:30:13,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:30:13,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:30:13,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:30:13,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:30:13,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:30:13,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:30:13,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:30:13,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:30:13,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:30:13,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:30:13,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:30:13,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:30:13,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:30:13,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:30:13,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:30:13,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:30:13,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:30:13,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:30:13,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:30:13,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:30:13,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:30:13,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:30:13,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:30:13,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:30:13,091 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:30:13,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:30:13,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:30:13,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:30:13,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:30:13,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:30:13,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:30:13,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:30:13,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:30:13,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:30:13,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:30:13,293 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:30:13,294 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-27 10:30:13,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9e9d9d8/af11890467f0489db579a7f9a3905aab/FLAGc61c067ad [2022-04-27 10:30:13,633 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:30:13,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i [2022-04-27 10:30:13,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9e9d9d8/af11890467f0489db579a7f9a3905aab/FLAGc61c067ad [2022-04-27 10:30:14,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9e9d9d8/af11890467f0489db579a7f9a3905aab [2022-04-27 10:30:14,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:30:14,086 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:30:14,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:30:14,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:30:14,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:30:14,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2043f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14, skipping insertion in model container [2022-04-27 10:30:14,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:30:14,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:30:14,255 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-27 10:30:14,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:30:14,273 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:30:14,282 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-27 10:30:14,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:30:14,299 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:30:14,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14 WrapperNode [2022-04-27 10:30:14,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:30:14,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:30:14,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:30:14,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:30:14,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:30:14,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:30:14,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:30:14,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:30:14,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (1/1) ... [2022-04-27 10:30:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:30:14,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:14,347 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-27 10:30:14,351 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-27 10:30:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:30:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:30:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:30:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:30:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:30:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:30:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:30:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:30:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:30:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:30:14,437 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:30:14,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:30:14,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:30:14,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:30:14,611 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:30:14,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:30:14 BoogieIcfgContainer [2022-04-27 10:30:14,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:30:14,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:30:14,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:30:14,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:30:14,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:30:14" (1/3) ... [2022-04-27 10:30:14,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b656d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:30:14, skipping insertion in model container [2022-04-27 10:30:14,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:14" (2/3) ... [2022-04-27 10:30:14,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b656d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:30:14, skipping insertion in model container [2022-04-27 10:30:14,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:30:14" (3/3) ... [2022-04-27 10:30:14,632 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-2.i [2022-04-27 10:30:14,642 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:30:14,642 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:30:14,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:30:14,677 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16fb344b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67cf7a11 [2022-04-27 10:30:14,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:30:14,685 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-27 10:30:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:30:14,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:14,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:14,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 1 times [2022-04-27 10:30:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:14,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316675490] [2022-04-27 10:30:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:14,870 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-27 10:30:14,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:30:14,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-27 10:30:14,872 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-27 10:30:14,872 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-27 10:30:14,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:30:14,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-27 10:30:14,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-27 10:30:14,873 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-27 10:30:14,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 10:30:14,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0; {28#false} is VALID [2022-04-27 10:30:14,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-27 10:30:14,874 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-27 10:30:14,874 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-27 10:30:14,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 10:30:14,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:30:14,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:30:14,875 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-27 10:30:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316675490] [2022-04-27 10:30:14,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316675490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:30:14,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:30:14,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:30:14,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858727348] [2022-04-27 10:30:14,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:30:14,881 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-27 10:30:14,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:14,884 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-27 10:30:14,902 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-27 10:30:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:30:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:30:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:30:14,937 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-27 10:30:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,025 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 10:30:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:30:15,025 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-27 10:30:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:15,026 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-27 10:30:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 10:30:15,031 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-27 10:30:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 10:30:15,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-27 10:30:15,077 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-27 10:30:15,082 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:30:15,082 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:30:15,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:30:15,087 INFO L413 NwaCegarLoop]: 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-27 10:30:15,087 INFO L414 NwaCegarLoop]: 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-27 10:30:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:30:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:30:15,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:15,106 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-27 10:30:15,106 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-27 10:30:15,107 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-27 10:30:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,108 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:30:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:30:15,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,109 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-27 10:30:15,109 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-27 10:30:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,118 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:30:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:30:15,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:15,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:15,120 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-27 10:30:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 10:30:15,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-27 10:30:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:15,126 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 10:30:15,127 INFO L496 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-27 10:30:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:30:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:30:15,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:15,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:15,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:30:15,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 1 times [2022-04-27 10:30:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822710647] [2022-04-27 10:30:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {145#true} is VALID [2022-04-27 10:30:15,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 10:30:15,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145#true} {145#true} #58#return; {145#true} is VALID [2022-04-27 10:30:15,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:15,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {145#true} is VALID [2022-04-27 10:30:15,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 10:30:15,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #58#return; {145#true} is VALID [2022-04-27 10:30:15,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret8 := main(); {145#true} is VALID [2022-04-27 10:30:15,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#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; {150#(= main_~i~0 0)} is VALID [2022-04-27 10:30:15,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#(= main_~i~0 0)} assume !(~i~0 < 2048); {146#false} is VALID [2022-04-27 10:30:15,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} ~i~0 := 0; {146#false} is VALID [2022-04-27 10:30:15,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#false} assume !(~i~0 < 2048); {146#false} is VALID [2022-04-27 10:30:15,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#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); {146#false} is VALID [2022-04-27 10:30:15,234 INFO L272 TraceCheckUtils]: 10: Hoare triple {146#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {146#false} is VALID [2022-04-27 10:30:15,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#false} ~cond := #in~cond; {146#false} is VALID [2022-04-27 10:30:15,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume 0 == ~cond; {146#false} is VALID [2022-04-27 10:30:15,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 10:30:15,235 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-27 10:30:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822710647] [2022-04-27 10:30:15,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822710647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:30:15,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:30:15,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:30:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765152005] [2022-04-27 10:30:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:30:15,238 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-27 10:30:15,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:15,238 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-27 10:30:15,253 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-27 10:30:15,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:30:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:30:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:30:15,255 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-27 10:30:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,323 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 10:30:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:30:15,324 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-27 10:30:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:15,324 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-27 10:30:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 10:30:15,328 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-27 10:30:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 10:30:15,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-27 10:30:15,360 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-27 10:30:15,363 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:30:15,363 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 10:30:15,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:30:15,369 INFO L413 NwaCegarLoop]: 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-27 10:30:15,369 INFO L414 NwaCegarLoop]: 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-27 10:30:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 10:30:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-27 10:30:15,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:15,376 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-27 10:30:15,377 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-27 10:30:15,377 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-27 10:30:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,379 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 10:30:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 10:30:15,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,379 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-27 10:30:15,380 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-27 10:30:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,382 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 10:30:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 10:30:15,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:15,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:15,383 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-27 10:30:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-27 10:30:15,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-27 10:30:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:15,385 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-27 10:30:15,385 INFO L496 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-27 10:30:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 10:30:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:30:15,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:15,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:15,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:30:15,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 1 times [2022-04-27 10:30:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:15,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657087243] [2022-04-27 10:30:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {270#true} is VALID [2022-04-27 10:30:15,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 10:30:15,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {270#true} {270#true} #58#return; {270#true} is VALID [2022-04-27 10:30:15,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:15,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {270#true} is VALID [2022-04-27 10:30:15,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 10:30:15,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #58#return; {270#true} is VALID [2022-04-27 10:30:15,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret8 := main(); {270#true} is VALID [2022-04-27 10:30:15,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#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; {275#(= main_~i~0 0)} is VALID [2022-04-27 10:30:15,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#(= 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; {275#(= main_~i~0 0)} is VALID [2022-04-27 10:30:15,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {276#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:15,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(<= main_~i~0 1)} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#false} ~i~0 := 0; {271#false} is VALID [2022-04-27 10:30:15,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {271#false} is VALID [2022-04-27 10:30:15,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {271#false} is VALID [2022-04-27 10:30:15,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#false} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#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); {271#false} is VALID [2022-04-27 10:30:15,485 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {271#false} is VALID [2022-04-27 10:30:15,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {271#false} ~cond := #in~cond; {271#false} is VALID [2022-04-27 10:30:15,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {271#false} assume 0 == ~cond; {271#false} is VALID [2022-04-27 10:30:15,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {271#false} assume !false; {271#false} is VALID [2022-04-27 10:30:15,489 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-27 10:30:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657087243] [2022-04-27 10:30:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657087243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212938031] [2022-04-27 10:30:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:15,493 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-27 10:30:15,494 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-27 10:30:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:30:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:15,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:15,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {270#true} is VALID [2022-04-27 10:30:15,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {270#true} is VALID [2022-04-27 10:30:15,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 10:30:15,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #58#return; {270#true} is VALID [2022-04-27 10:30:15,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret8 := main(); {270#true} is VALID [2022-04-27 10:30:15,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#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; {296#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:15,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(<= 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; {296#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:15,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {276#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:15,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(<= main_~i~0 1)} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#false} ~i~0 := 0; {271#false} is VALID [2022-04-27 10:30:15,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {271#false} is VALID [2022-04-27 10:30:15,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {271#false} is VALID [2022-04-27 10:30:15,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#false} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#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); {271#false} is VALID [2022-04-27 10:30:15,648 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {271#false} is VALID [2022-04-27 10:30:15,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {271#false} ~cond := #in~cond; {271#false} is VALID [2022-04-27 10:30:15,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {271#false} assume 0 == ~cond; {271#false} is VALID [2022-04-27 10:30:15,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {271#false} assume !false; {271#false} is VALID [2022-04-27 10:30:15,649 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-27 10:30:15,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:15,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {271#false} assume !false; {271#false} is VALID [2022-04-27 10:30:15,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {271#false} assume 0 == ~cond; {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {271#false} ~cond := #in~cond; {271#false} is VALID [2022-04-27 10:30:15,745 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#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); {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#false} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {271#false} is VALID [2022-04-27 10:30:15,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#false} ~i~0 := 0; {271#false} is VALID [2022-04-27 10:30:15,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(< main_~i~0 2048)} assume !(~i~0 < 2048); {271#false} is VALID [2022-04-27 10:30:15,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {360#(< main_~i~0 2048)} is VALID [2022-04-27 10:30:15,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(< 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; {364#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:15,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#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; {364#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:15,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret8 := main(); {270#true} is VALID [2022-04-27 10:30:15,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #58#return; {270#true} is VALID [2022-04-27 10:30:15,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 10:30:15,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {270#true} is VALID [2022-04-27 10:30:15,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {270#true} is VALID [2022-04-27 10:30:15,763 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-27 10:30:15,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212938031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:15,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:15,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:30:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312292692] [2022-04-27 10:30:15,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:30:15,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:15,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:15,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:15,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:30:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:15,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:30:15,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:30:15,794 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,925 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 10:30:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:30:15,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:30:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:30:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:30:15,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 10:30:15,970 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-27 10:30:15,971 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:30:15,972 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 10:30:15,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:30:15,973 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:15,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 26 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:30:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 10:30:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 10:30:15,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:15,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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-27 10:30:15,981 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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-27 10:30:15,981 INFO L87 Difference]: Start difference. First operand 31 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-27 10:30:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,982 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 10:30:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:30:15,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,983 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 31 states. [2022-04-27 10:30:15,983 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 31 states. [2022-04-27 10:30:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:15,988 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 10:30:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:30:15,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:15,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:15,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:15,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:15,989 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-27 10:30:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-27 10:30:15,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 18 [2022-04-27 10:30:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:15,993 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-27 10:30:15,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:30:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:30:15,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:15,995 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:16,014 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-27 10:30:16,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:16,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 2 times [2022-04-27 10:30:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731817422] [2022-04-27 10:30:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:16,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {566#true} is VALID [2022-04-27 10:30:16,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#true} assume true; {566#true} is VALID [2022-04-27 10:30:16,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {566#true} {566#true} #58#return; {566#true} is VALID [2022-04-27 10:30:16,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:16,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {566#true} is VALID [2022-04-27 10:30:16,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2022-04-27 10:30:16,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #58#return; {566#true} is VALID [2022-04-27 10:30:16,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret8 := main(); {566#true} is VALID [2022-04-27 10:30:16,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#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; {571#(= main_~i~0 0)} is VALID [2022-04-27 10:30:16,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#(= 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; {571#(= main_~i~0 0)} is VALID [2022-04-27 10:30:16,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {572#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:16,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {572#(<= 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; {572#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:16,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {573#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:16,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(<= 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; {573#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:16,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {574#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:16,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(<= 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; {574#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:16,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {574#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {575#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:16,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#(<= main_~i~0 4)} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} ~i~0 := 0; {567#false} is VALID [2022-04-27 10:30:16,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {567#false} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {567#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); {567#false} is VALID [2022-04-27 10:30:16,360 INFO L272 TraceCheckUtils]: 26: Hoare triple {567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {567#false} is VALID [2022-04-27 10:30:16,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-04-27 10:30:16,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-04-27 10:30:16,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-04-27 10:30:16,360 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-27 10:30:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731817422] [2022-04-27 10:30:16,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731817422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114895278] [2022-04-27 10:30:16,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:30:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:16,363 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-27 10:30:16,364 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-27 10:30:16,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:30:16,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:30:16,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:30:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:16,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:16,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2022-04-27 10:30:16,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {566#true} is VALID [2022-04-27 10:30:16,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2022-04-27 10:30:16,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #58#return; {566#true} is VALID [2022-04-27 10:30:16,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret8 := main(); {566#true} is VALID [2022-04-27 10:30:16,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#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; {595#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:16,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(<= 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; {595#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:16,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {572#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:16,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {572#(<= 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; {572#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:16,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {573#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:16,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(<= 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; {573#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:16,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {574#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:16,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(<= 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; {574#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:16,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {574#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {575#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:16,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#(<= main_~i~0 4)} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} ~i~0 := 0; {567#false} is VALID [2022-04-27 10:30:16,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {567#false} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {567#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); {567#false} is VALID [2022-04-27 10:30:16,587 INFO L272 TraceCheckUtils]: 26: Hoare triple {567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {567#false} is VALID [2022-04-27 10:30:16,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-04-27 10:30:16,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-04-27 10:30:16,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-04-27 10:30:16,588 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-27 10:30:16,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:16,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-04-27 10:30:16,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-04-27 10:30:16,747 INFO L272 TraceCheckUtils]: 26: Hoare triple {567#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {567#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); {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {567#false} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {567#false} is VALID [2022-04-27 10:30:16,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#false} is VALID [2022-04-27 10:30:16,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} ~i~0 := 0; {567#false} is VALID [2022-04-27 10:30:16,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {713#(< main_~i~0 2048)} assume !(~i~0 < 2048); {567#false} is VALID [2022-04-27 10:30:16,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {713#(< main_~i~0 2048)} is VALID [2022-04-27 10:30:16,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(< 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; {717#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:16,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {724#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {717#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:16,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {724#(< 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; {724#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:16,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {724#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:16,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(< 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; {731#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:16,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {731#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:16,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(< 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; {738#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:16,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#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; {738#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:16,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret8 := main(); {566#true} is VALID [2022-04-27 10:30:16,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #58#return; {566#true} is VALID [2022-04-27 10:30:16,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2022-04-27 10:30:16,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {566#true} is VALID [2022-04-27 10:30:16,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2022-04-27 10:30:16,752 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-27 10:30:16,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114895278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:16,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:16,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:30:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282222822] [2022-04-27 10:30:16,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:30:16,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:16,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:16,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:16,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:30:16,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:16,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:30:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:30:16,780 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:17,099 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-27 10:30:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:30:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:30:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-27 10:30:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-27 10:30:17,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2022-04-27 10:30:17,161 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-27 10:30:17,162 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:30:17,162 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 10:30:17,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:30:17,163 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:17,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:30:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 10:30:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 10:30:17,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:17,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 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-27 10:30:17,177 INFO L74 IsIncluded]: Start isIncluded. First operand 55 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-27 10:30:17,177 INFO L87 Difference]: Start difference. First operand 55 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-27 10:30:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:17,179 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-04-27 10:30:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-27 10:30:17,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:17,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:17,179 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 55 states. [2022-04-27 10:30:17,180 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 55 states. [2022-04-27 10:30:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:17,181 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-04-27 10:30:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-27 10:30:17,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:17,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:17,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:17,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:17,182 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-27 10:30:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-27 10:30:17,183 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 30 [2022-04-27 10:30:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:17,183 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-27 10:30:17,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-27 10:30:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 10:30:17,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:17,184 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:17,208 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-27 10:30:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:30:17,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 3 times [2022-04-27 10:30:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:17,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434529712] [2022-04-27 10:30:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:17,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1081#true} is VALID [2022-04-27 10:30:17,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-27 10:30:17,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1081#true} {1081#true} #58#return; {1081#true} is VALID [2022-04-27 10:30:17,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:17,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1081#true} is VALID [2022-04-27 10:30:17,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-27 10:30:17,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1081#true} {1081#true} #58#return; {1081#true} is VALID [2022-04-27 10:30:17,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1081#true} call #t~ret8 := main(); {1081#true} is VALID [2022-04-27 10:30:17,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#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; {1086#(= main_~i~0 0)} is VALID [2022-04-27 10:30:17,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1086#(= 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; {1086#(= main_~i~0 0)} is VALID [2022-04-27 10:30:17,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {1086#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1087#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:17,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {1087#(<= 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; {1087#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:17,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1087#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:17,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1088#(<= 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; {1088#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:17,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1088#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1089#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:17,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#(<= 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; {1089#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:17,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1090#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:17,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1090#(<= 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; {1090#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:17,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1090#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1091#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:17,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#(<= 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; {1091#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:17,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:17,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(<= 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; {1092#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:17,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1093#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:17,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {1093#(<= 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; {1093#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:17,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:17,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#(<= 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; {1094#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:17,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:17,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {1095#(<= 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; {1095#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:17,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {1095#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {1096#(<= main_~i~0 10)} assume !(~i~0 < 2048); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {1082#false} ~i~0 := 0; {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {1082#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {1082#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {1082#false} assume !(~i~0 < 2048); {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {1082#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); {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L272 TraceCheckUtils]: 50: Hoare triple {1082#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {1082#false} assume 0 == ~cond; {1082#false} is VALID [2022-04-27 10:30:17,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2022-04-27 10:30:17,611 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-27 10:30:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434529712] [2022-04-27 10:30:17,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434529712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103646459] [2022-04-27 10:30:17,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:30:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:17,613 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-27 10:30:17,647 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-27 10:30:19,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:30:19,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:30:19,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:30:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:19,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:19,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2022-04-27 10:30:19,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1081#true} is VALID [2022-04-27 10:30:19,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-27 10:30:19,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1081#true} {1081#true} #58#return; {1081#true} is VALID [2022-04-27 10:30:19,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1081#true} call #t~ret8 := main(); {1081#true} is VALID [2022-04-27 10:30:19,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#true} assume !(~i~0 < 2048); {1081#true} is VALID [2022-04-27 10:30:19,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {1081#true} ~i~0 := 0; {1182#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:19,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {1182#(<= 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); {1182#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:19,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {1182#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1087#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:19,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {1087#(<= 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); {1087#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:19,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {1087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1088#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:19,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {1088#(<= 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); {1088#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:19,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {1088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1089#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:19,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {1089#(<= 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); {1089#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:19,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {1089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1090#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:19,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {1090#(<= 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); {1090#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:19,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {1090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1091#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:19,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {1091#(<= 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); {1091#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:19,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {1091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:19,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {1092#(<= 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); {1092#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:19,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {1092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:19,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {1093#(<= 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); {1093#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:19,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {1093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1094#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:19,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {1094#(<= 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); {1094#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:19,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {1094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1095#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:19,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {1095#(<= 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); {1095#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {1095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1096#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {1096#(<= main_~i~0 10)} assume !(~i~0 < 2048); {1082#false} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {1082#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); {1082#false} is VALID [2022-04-27 10:30:19,580 INFO L272 TraceCheckUtils]: 50: Hoare triple {1082#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1082#false} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {1082#false} assume 0 == ~cond; {1082#false} is VALID [2022-04-27 10:30:19,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2022-04-27 10:30:19,582 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-27 10:30:19,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:19,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2022-04-27 10:30:19,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {1082#false} assume 0 == ~cond; {1082#false} is VALID [2022-04-27 10:30:19,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2022-04-27 10:30:19,862 INFO L272 TraceCheckUtils]: 50: Hoare triple {1082#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1082#false} is VALID [2022-04-27 10:30:19,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {1082#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); {1082#false} is VALID [2022-04-27 10:30:19,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {1276#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1082#false} is VALID [2022-04-27 10:30:19,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {1280#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1276#(< main_~i~0 2048)} is VALID [2022-04-27 10:30:19,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {1280#(< 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); {1280#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:19,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {1287#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1280#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:19,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {1287#(< 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); {1287#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:19,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {1294#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1287#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:19,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {1294#(< 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); {1294#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:19,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {1301#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1294#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:19,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {1301#(< 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); {1301#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:19,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {1308#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1301#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:19,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {1308#(< 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); {1308#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:19,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {1315#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1308#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:19,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {1315#(< 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); {1315#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:19,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1315#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:19,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#(< 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); {1322#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:19,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {1329#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1322#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:19,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {1329#(< 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); {1329#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:19,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {1336#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1329#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:19,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {1336#(< 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); {1336#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:19,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {1343#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1336#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {1343#(< 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); {1343#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {1081#true} ~i~0 := 0; {1343#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#true} assume !(~i~0 < 2048); {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#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; {1081#true} is VALID [2022-04-27 10:30:19,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1081#true} call #t~ret8 := main(); {1081#true} is VALID [2022-04-27 10:30:19,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1081#true} {1081#true} #58#return; {1081#true} is VALID [2022-04-27 10:30:19,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-27 10:30:19,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1081#true} is VALID [2022-04-27 10:30:19,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2022-04-27 10:30:19,873 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-27 10:30:19,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103646459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:19,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:19,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:30:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977717105] [2022-04-27 10:30:19,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-27 10:30:19,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:19,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:19,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:19,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:30:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:30:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:30:19,929 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:20,603 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2022-04-27 10:30:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:30:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-27 10:30:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 137 transitions. [2022-04-27 10:30:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 137 transitions. [2022-04-27 10:30:20,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 137 transitions. [2022-04-27 10:30:20,704 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-27 10:30:20,706 INFO L225 Difference]: With dead ends: 131 [2022-04-27 10:30:20,706 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 10:30:20,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:30:20,708 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:20,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 31 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:30:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 10:30:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 10:30:20,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:20,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 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-27 10:30:20,740 INFO L74 IsIncluded]: Start isIncluded. First operand 103 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-27 10:30:20,740 INFO L87 Difference]: Start difference. First operand 103 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-27 10:30:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:20,742 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2022-04-27 10:30:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-27 10:30:20,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:20,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:20,743 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 103 states. [2022-04-27 10:30:20,743 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 103 states. [2022-04-27 10:30:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:20,759 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2022-04-27 10:30:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-27 10:30:20,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:20,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:20,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:20,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:20,760 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-27 10:30:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-27 10:30:20,763 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 54 [2022-04-27 10:30:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:20,763 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-27 10:30:20,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-27 10:30:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 10:30:20,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:20,765 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:20,784 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-27 10:30:20,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:20,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 4 times [2022-04-27 10:30:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:20,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338497198] [2022-04-27 10:30:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:21,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {2084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2056#true} is VALID [2022-04-27 10:30:21,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2056#true} assume true; {2056#true} is VALID [2022-04-27 10:30:21,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2056#true} {2056#true} #58#return; {2056#true} is VALID [2022-04-27 10:30:21,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {2056#true} call ULTIMATE.init(); {2084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:21,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {2084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2056#true} is VALID [2022-04-27 10:30:21,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2022-04-27 10:30:21,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #58#return; {2056#true} is VALID [2022-04-27 10:30:21,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {2056#true} call #t~ret8 := main(); {2056#true} is VALID [2022-04-27 10:30:21,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {2056#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; {2061#(= main_~i~0 0)} is VALID [2022-04-27 10:30:21,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {2061#(= 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; {2061#(= main_~i~0 0)} is VALID [2022-04-27 10:30:21,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {2061#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2062#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:21,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {2062#(<= 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; {2062#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:21,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2063#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:21,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {2063#(<= 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; {2063#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:21,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2064#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:21,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {2064#(<= 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; {2064#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:21,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {2064#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2065#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:21,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#(<= 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; {2065#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:21,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2066#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:21,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {2066#(<= 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; {2066#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:21,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {2066#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2067#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:21,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2067#(<= 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; {2067#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:21,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {2067#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2068#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:21,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {2068#(<= 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; {2068#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:21,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {2068#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2069#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:21,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {2069#(<= 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; {2069#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:21,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {2069#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2070#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:21,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {2070#(<= 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; {2070#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:21,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2071#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:21,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(<= 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; {2071#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:21,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2072#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:21,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {2072#(<= 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; {2072#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:21,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {2072#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2073#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:21,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(<= 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; {2073#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:21,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2074#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:21,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {2074#(<= 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; {2074#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:21,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {2074#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2075#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:21,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {2075#(<= 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; {2075#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:21,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {2075#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2076#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:21,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {2076#(<= 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; {2076#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:21,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {2076#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2077#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:21,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {2077#(<= 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; {2077#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:21,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {2077#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2078#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:21,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {2078#(<= 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; {2078#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:21,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {2078#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2079#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:21,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {2079#(<= 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; {2079#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:21,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {2079#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2080#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:21,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {2080#(<= 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; {2080#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:21,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {2080#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2081#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:21,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {2081#(<= 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; {2081#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:21,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {2081#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2082#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:21,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {2082#(<= 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; {2082#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:21,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {2082#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2083#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:21,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {2083#(<= main_~i~0 22)} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:21,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {2057#false} ~i~0 := 0; {2057#false} is VALID [2022-04-27 10:30:21,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 75: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 77: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,509 INFO L290 TraceCheckUtils]: 83: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 86: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 87: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 88: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 91: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 95: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 96: Hoare triple {2057#false} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {2057#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); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L272 TraceCheckUtils]: 98: Hoare triple {2057#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2057#false} is VALID [2022-04-27 10:30:21,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {2057#false} ~cond := #in~cond; {2057#false} is VALID [2022-04-27 10:30:21,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {2057#false} assume 0 == ~cond; {2057#false} is VALID [2022-04-27 10:30:21,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {2057#false} assume !false; {2057#false} is VALID [2022-04-27 10:30:21,511 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-27 10:30:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:21,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338497198] [2022-04-27 10:30:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338497198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210437] [2022-04-27 10:30:21,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:30:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:21,513 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-27 10:30:21,514 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-27 10:30:21,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:30:21,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:30:21,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 10:30:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:21,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:22,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {2056#true} call ULTIMATE.init(); {2056#true} is VALID [2022-04-27 10:30:22,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2056#true} is VALID [2022-04-27 10:30:22,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2022-04-27 10:30:22,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #58#return; {2056#true} is VALID [2022-04-27 10:30:22,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2056#true} call #t~ret8 := main(); {2056#true} is VALID [2022-04-27 10:30:22,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2056#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; {2103#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:22,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2103#(<= 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; {2103#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:22,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2103#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2062#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:22,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2062#(<= 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; {2062#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:22,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2063#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:22,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2063#(<= 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; {2063#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:22,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2064#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:22,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {2064#(<= 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; {2064#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:22,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {2064#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2065#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:22,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#(<= 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; {2065#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:22,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2066#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:22,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {2066#(<= 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; {2066#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:22,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {2066#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2067#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:22,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {2067#(<= 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; {2067#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:22,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {2067#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2068#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:22,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {2068#(<= 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; {2068#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:22,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {2068#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2069#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:22,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {2069#(<= 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; {2069#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:22,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {2069#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2070#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:22,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {2070#(<= 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; {2070#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:22,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2071#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:22,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(<= 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; {2071#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:22,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2072#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:22,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {2072#(<= 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; {2072#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:22,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {2072#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2073#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:22,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(<= 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; {2073#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:22,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2074#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:22,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {2074#(<= 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; {2074#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:22,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {2074#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2075#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:22,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {2075#(<= 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; {2075#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:22,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {2075#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2076#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:22,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {2076#(<= 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; {2076#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:22,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {2076#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2077#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:22,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {2077#(<= 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; {2077#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:22,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {2077#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2078#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:22,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {2078#(<= 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; {2078#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:22,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {2078#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2079#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:22,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {2079#(<= 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; {2079#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:22,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {2079#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2080#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:22,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {2080#(<= 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; {2080#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:22,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {2080#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2081#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:22,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {2081#(<= 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; {2081#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:22,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {2081#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2082#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:22,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {2082#(<= 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; {2082#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:22,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {2082#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2083#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {2083#(<= main_~i~0 22)} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {2057#false} ~i~0 := 0; {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 75: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 81: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 82: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 83: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 86: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 87: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 89: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 90: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 91: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 92: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,085 INFO L290 TraceCheckUtils]: 93: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 94: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 95: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 96: Hoare triple {2057#false} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 97: Hoare triple {2057#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); {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L272 TraceCheckUtils]: 98: Hoare triple {2057#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {2057#false} ~cond := #in~cond; {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 100: Hoare triple {2057#false} assume 0 == ~cond; {2057#false} is VALID [2022-04-27 10:30:22,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {2057#false} assume !false; {2057#false} is VALID [2022-04-27 10:30:22,087 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-27 10:30:22,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:23,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {2057#false} assume !false; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 100: Hoare triple {2057#false} assume 0 == ~cond; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 99: Hoare triple {2057#false} ~cond := #in~cond; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L272 TraceCheckUtils]: 98: Hoare triple {2057#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {2057#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); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {2057#false} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 85: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 84: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 83: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 82: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 80: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 76: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {2057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2057#false} is VALID [2022-04-27 10:30:23,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {2057#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2057#false} is VALID [2022-04-27 10:30:23,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {2057#false} ~i~0 := 0; {2057#false} is VALID [2022-04-27 10:30:23,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {2545#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2057#false} is VALID [2022-04-27 10:30:23,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {2549#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2545#(< main_~i~0 2048)} is VALID [2022-04-27 10:30:23,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {2549#(< 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; {2549#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:23,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {2556#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2549#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:23,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {2556#(< 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; {2556#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:23,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {2563#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2556#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:23,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {2563#(< 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; {2563#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:23,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {2570#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2563#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:23,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {2570#(< 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; {2570#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:23,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {2577#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2570#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:23,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {2577#(< 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; {2577#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:23,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {2584#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2577#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:23,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {2584#(< 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; {2584#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:23,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {2591#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2584#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:23,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {2591#(< 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; {2591#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:23,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2591#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:23,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(< 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; {2598#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:23,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {2605#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2598#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:23,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {2605#(< 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; {2605#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:23,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {2612#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2605#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:23,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#(< 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; {2612#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:23,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {2619#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2612#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:23,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {2619#(< 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; {2619#(< main_~i~0 2037)} is VALID [2022-04-27 10:30:23,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {2626#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2619#(< main_~i~0 2037)} is VALID [2022-04-27 10:30:23,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {2626#(< 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; {2626#(< main_~i~0 2036)} is VALID [2022-04-27 10:30:23,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {2633#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2626#(< main_~i~0 2036)} is VALID [2022-04-27 10:30:23,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {2633#(< 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; {2633#(< main_~i~0 2035)} is VALID [2022-04-27 10:30:23,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {2640#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2633#(< main_~i~0 2035)} is VALID [2022-04-27 10:30:23,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {2640#(< 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; {2640#(< main_~i~0 2034)} is VALID [2022-04-27 10:30:23,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {2647#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2640#(< main_~i~0 2034)} is VALID [2022-04-27 10:30:23,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {2647#(< 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; {2647#(< main_~i~0 2033)} is VALID [2022-04-27 10:30:23,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {2654#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2647#(< main_~i~0 2033)} is VALID [2022-04-27 10:30:23,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {2654#(< 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; {2654#(< main_~i~0 2032)} is VALID [2022-04-27 10:30:23,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {2661#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2654#(< main_~i~0 2032)} is VALID [2022-04-27 10:30:23,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2661#(< 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; {2661#(< main_~i~0 2031)} is VALID [2022-04-27 10:30:23,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2668#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2661#(< main_~i~0 2031)} is VALID [2022-04-27 10:30:23,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(< 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; {2668#(< main_~i~0 2030)} is VALID [2022-04-27 10:30:23,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {2675#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2668#(< main_~i~0 2030)} is VALID [2022-04-27 10:30:23,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {2675#(< 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; {2675#(< main_~i~0 2029)} is VALID [2022-04-27 10:30:23,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {2682#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2675#(< main_~i~0 2029)} is VALID [2022-04-27 10:30:23,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {2682#(< 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; {2682#(< main_~i~0 2028)} is VALID [2022-04-27 10:30:23,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {2689#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2682#(< main_~i~0 2028)} is VALID [2022-04-27 10:30:23,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#(< 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; {2689#(< main_~i~0 2027)} is VALID [2022-04-27 10:30:23,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2696#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2689#(< main_~i~0 2027)} is VALID [2022-04-27 10:30:23,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2696#(< 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; {2696#(< main_~i~0 2026)} is VALID [2022-04-27 10:30:23,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {2056#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; {2696#(< main_~i~0 2026)} is VALID [2022-04-27 10:30:23,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {2056#true} call #t~ret8 := main(); {2056#true} is VALID [2022-04-27 10:30:23,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #58#return; {2056#true} is VALID [2022-04-27 10:30:23,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2022-04-27 10:30:23,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2056#true} is VALID [2022-04-27 10:30:23,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {2056#true} call ULTIMATE.init(); {2056#true} is VALID [2022-04-27 10:30:23,060 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-27 10:30:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:23,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:23,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:30:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613771359] [2022-04-27 10:30:23,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:23,062 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-27 10:30:23,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:23,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:23,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:23,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:30:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:30:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:30:23,131 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:24,892 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-04-27 10:30:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 10:30:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-27 10:30:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 257 transitions. [2022-04-27 10:30:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 257 transitions. [2022-04-27 10:30:24,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 257 transitions. [2022-04-27 10:30:25,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:25,076 INFO L225 Difference]: With dead ends: 251 [2022-04-27 10:30:25,076 INFO L226 Difference]: Without dead ends: 199 [2022-04-27 10:30:25,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2022-04-27 10:30:25,079 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 362 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:25,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 31 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:30:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-04-27 10:30:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-04-27 10:30:25,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:25,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:25,137 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:25,138 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:25,142 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2022-04-27 10:30:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2022-04-27 10:30:25,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:25,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:25,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 199 states. [2022-04-27 10:30:25,144 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 199 states. [2022-04-27 10:30:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:25,148 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2022-04-27 10:30:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2022-04-27 10:30:25,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:25,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:25,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:25,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2022-04-27 10:30:25,166 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 102 [2022-04-27 10:30:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:25,167 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2022-04-27 10:30:25,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2022-04-27 10:30:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-27 10:30:25,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:25,170 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:25,189 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-27 10:30:25,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:25,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash -826337972, now seen corresponding path program 5 times [2022-04-27 10:30:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534787002] [2022-04-27 10:30:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:26,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {3937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3885#true} is VALID [2022-04-27 10:30:26,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {3885#true} assume true; {3885#true} is VALID [2022-04-27 10:30:26,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3885#true} {3885#true} #58#return; {3885#true} is VALID [2022-04-27 10:30:26,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {3885#true} call ULTIMATE.init(); {3937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:26,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {3937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3885#true} is VALID [2022-04-27 10:30:26,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {3885#true} assume true; {3885#true} is VALID [2022-04-27 10:30:26,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3885#true} {3885#true} #58#return; {3885#true} is VALID [2022-04-27 10:30:26,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {3885#true} call #t~ret8 := main(); {3885#true} is VALID [2022-04-27 10:30:26,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {3885#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; {3890#(= main_~i~0 0)} is VALID [2022-04-27 10:30:26,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {3890#(= 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; {3890#(= main_~i~0 0)} is VALID [2022-04-27 10:30:26,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {3890#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3891#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:26,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {3891#(<= 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; {3891#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:26,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {3891#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3892#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:26,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {3892#(<= 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; {3892#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:26,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {3892#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3893#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:26,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {3893#(<= 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; {3893#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:26,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {3893#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3894#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:26,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {3894#(<= 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; {3894#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:26,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {3894#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3895#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:26,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {3895#(<= 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; {3895#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:26,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {3895#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3896#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:26,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {3896#(<= 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; {3896#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:26,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {3896#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3897#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:26,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {3897#(<= 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; {3897#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:26,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {3897#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3898#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:26,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {3898#(<= 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; {3898#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:26,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {3898#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3899#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:26,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#(<= 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; {3899#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:26,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3900#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:26,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {3900#(<= 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; {3900#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:26,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {3900#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3901#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:26,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {3901#(<= 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; {3901#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:26,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {3901#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3902#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:26,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {3902#(<= 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; {3902#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:26,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {3902#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3903#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:26,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {3903#(<= 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; {3903#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:26,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {3903#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3904#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:26,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {3904#(<= 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; {3904#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:26,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {3904#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3905#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:26,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {3905#(<= 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; {3905#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:26,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {3905#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3906#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:26,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {3906#(<= 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; {3906#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:26,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {3906#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3907#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:26,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {3907#(<= 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; {3907#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:26,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {3907#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3908#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:26,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {3908#(<= 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; {3908#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:26,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {3908#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3909#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:26,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {3909#(<= 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; {3909#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:26,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {3909#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3910#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:26,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {3910#(<= 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; {3910#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:26,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {3910#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3911#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:26,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {3911#(<= 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; {3911#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:26,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {3911#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3912#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:26,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {3912#(<= 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; {3912#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:26,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {3912#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3913#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:26,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {3913#(<= 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; {3913#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:26,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {3913#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3914#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:26,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {3914#(<= 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; {3914#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:26,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {3914#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3915#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:26,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {3915#(<= 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; {3915#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:26,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {3915#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3916#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:26,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {3916#(<= 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; {3916#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:26,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {3916#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3917#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:26,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {3917#(<= 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; {3917#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:26,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {3917#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3918#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:26,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {3918#(<= 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; {3918#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:26,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {3918#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3919#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:26,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {3919#(<= 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; {3919#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:26,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {3919#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3920#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:26,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {3920#(<= main_~i~0 30)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3920#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:26,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {3920#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3921#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:26,474 INFO L290 TraceCheckUtils]: 68: Hoare triple {3921#(<= main_~i~0 31)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3921#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:26,474 INFO L290 TraceCheckUtils]: 69: Hoare triple {3921#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3922#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:26,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {3922#(<= main_~i~0 32)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3922#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:26,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {3922#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3923#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:26,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {3923#(<= main_~i~0 33)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3923#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:26,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {3923#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3924#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:26,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {3924#(<= main_~i~0 34)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3924#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:26,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {3924#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3925#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:26,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {3925#(<= main_~i~0 35)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3925#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:26,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {3925#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3926#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:26,477 INFO L290 TraceCheckUtils]: 78: Hoare triple {3926#(<= main_~i~0 36)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3926#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:26,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {3926#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3927#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:26,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {3927#(<= main_~i~0 37)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3927#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:26,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {3927#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3928#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:26,478 INFO L290 TraceCheckUtils]: 82: Hoare triple {3928#(<= main_~i~0 38)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3928#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:26,478 INFO L290 TraceCheckUtils]: 83: Hoare triple {3928#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3929#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:26,478 INFO L290 TraceCheckUtils]: 84: Hoare triple {3929#(<= main_~i~0 39)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3929#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:26,479 INFO L290 TraceCheckUtils]: 85: Hoare triple {3929#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3930#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:26,479 INFO L290 TraceCheckUtils]: 86: Hoare triple {3930#(<= main_~i~0 40)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3930#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:26,479 INFO L290 TraceCheckUtils]: 87: Hoare triple {3930#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3931#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:26,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {3931#(<= main_~i~0 41)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3931#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:26,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {3931#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3932#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:26,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {3932#(<= main_~i~0 42)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3932#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:26,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {3932#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3933#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:26,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {3933#(<= main_~i~0 43)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3933#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:26,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {3933#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3934#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:26,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {3934#(<= main_~i~0 44)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3934#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:26,481 INFO L290 TraceCheckUtils]: 95: Hoare triple {3934#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3935#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:26,481 INFO L290 TraceCheckUtils]: 96: Hoare triple {3935#(<= main_~i~0 45)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3935#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 97: Hoare triple {3935#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3936#(<= main_~i~0 46)} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 98: Hoare triple {3936#(<= main_~i~0 46)} assume !(~i~0 < 2048); {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 99: Hoare triple {3886#false} ~i~0 := 0; {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 100: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 101: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 102: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 103: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 104: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 106: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 109: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 110: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 111: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 112: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 113: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 114: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 115: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 116: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 117: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 118: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 119: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 120: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 121: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 122: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 123: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 124: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,483 INFO L290 TraceCheckUtils]: 125: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 126: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 127: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 128: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 129: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 130: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 131: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 132: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 133: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 134: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 135: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 136: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 137: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 138: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 139: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 140: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 141: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,484 INFO L290 TraceCheckUtils]: 142: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 143: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 144: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 145: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 146: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 147: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 148: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 149: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 150: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 151: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 152: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 153: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 154: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 155: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 156: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 157: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 158: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,485 INFO L290 TraceCheckUtils]: 159: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 160: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 161: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 162: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 163: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 164: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 165: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 166: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 167: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 168: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 169: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 170: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 171: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 172: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 173: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 174: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 175: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,486 INFO L290 TraceCheckUtils]: 176: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 177: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 178: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 179: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 180: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 181: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 182: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 183: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 184: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 185: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 186: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 187: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 188: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 189: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 190: Hoare triple {3886#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 191: Hoare triple {3886#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3886#false} is VALID [2022-04-27 10:30:26,487 INFO L290 TraceCheckUtils]: 192: Hoare triple {3886#false} assume !(~i~0 < 2048); {3886#false} is VALID [2022-04-27 10:30:26,488 INFO L290 TraceCheckUtils]: 193: Hoare triple {3886#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); {3886#false} is VALID [2022-04-27 10:30:26,488 INFO L272 TraceCheckUtils]: 194: Hoare triple {3886#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3886#false} is VALID [2022-04-27 10:30:26,488 INFO L290 TraceCheckUtils]: 195: Hoare triple {3886#false} ~cond := #in~cond; {3886#false} is VALID [2022-04-27 10:30:26,488 INFO L290 TraceCheckUtils]: 196: Hoare triple {3886#false} assume 0 == ~cond; {3886#false} is VALID [2022-04-27 10:30:26,488 INFO L290 TraceCheckUtils]: 197: Hoare triple {3886#false} assume !false; {3886#false} is VALID [2022-04-27 10:30:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2022-04-27 10:30:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534787002] [2022-04-27 10:30:26,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534787002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620356755] [2022-04-27 10:30:26,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:30:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:26,491 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-27 10:30:26,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process