java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:52,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:52,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:52,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:52,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:52,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:52,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:52,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:52,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:52,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:52,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:52,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:52,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:52,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:52,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:52,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:52,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:52,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:52,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:52,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:52,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:52,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:52,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:52,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:52,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:52,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:52,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:52,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:52,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:52,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:52,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:52,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:52,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:52,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:52,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:52,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:52,245 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:52,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:52,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:52,270 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:52,270 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:52,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:52,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:52,272 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:52,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:52,272 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:52,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:52,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:52,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:52,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:52,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:52,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:52,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:52,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:52,275 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:52,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:52,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:52,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:52,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:52,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:52,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:52,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:52,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:52,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:52,278 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:52,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:52,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:52,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:52,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:52,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:52,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:52,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:52,368 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:52,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-23 13:04:52,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d085c2fdc/9d4e5cb5b7b340cb85225678f5b98bc2/FLAGc35df2c29 [2018-11-23 13:04:52,930 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:52,930 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-23 13:04:52,937 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d085c2fdc/9d4e5cb5b7b340cb85225678f5b98bc2/FLAGc35df2c29 [2018-11-23 13:04:53,279 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d085c2fdc/9d4e5cb5b7b340cb85225678f5b98bc2 [2018-11-23 13:04:53,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:53,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:53,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:53,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:53,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:53,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ba15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53, skipping insertion in model container [2018-11-23 13:04:53,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:53,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:53,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:53,583 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:53,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:53,628 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:53,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53 WrapperNode [2018-11-23 13:04:53,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:53,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:53,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:53,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:53,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:53,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:53,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:53,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:53,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... [2018-11-23 13:04:53,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:53,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:53,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:53,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:53,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:54,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:54,294 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:54,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:54 BoogieIcfgContainer [2018-11-23 13:04:54,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:54,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:54,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:54,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:54,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:53" (1/3) ... [2018-11-23 13:04:54,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cfa5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:54, skipping insertion in model container [2018-11-23 13:04:54,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:53" (2/3) ... [2018-11-23 13:04:54,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cfa5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:54, skipping insertion in model container [2018-11-23 13:04:54,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:54" (3/3) ... [2018-11-23 13:04:54,303 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call2_true-termination.i [2018-11-23 13:04:54,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:54,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:54,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:54,368 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:54,369 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:54,369 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:54,370 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:54,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:54,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:54,371 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:54,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:54,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:04:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:54,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:54,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:54,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:54,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 13:04:54,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:54,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:04:54,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 13:04:54,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:04:54,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 13:04:54,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2018-11-23 13:04:54,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24#true} is VALID [2018-11-23 13:04:54,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:04:54,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25#false} is VALID [2018-11-23 13:04:54,586 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {25#false} is VALID [2018-11-23 13:04:54,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:04:54,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:04:54,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:04:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:54,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:54,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:54,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:54,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:54,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:54,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:54,663 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:04:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,768 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:04:54,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:54,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:04:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:04:54,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 13:04:55,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,126 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:04:55,126 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:04:55,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:04:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:04:55,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:55,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:55,170 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:55,170 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,173 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:55,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,174 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:55,174 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,177 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:55,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:04:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:04:55,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:04:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:55,183 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:04:55,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:55,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:55,184 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 13:04:55,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2018-11-23 13:04:55,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {120#true} is VALID [2018-11-23 13:04:55,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2018-11-23 13:04:55,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #35#return; {120#true} is VALID [2018-11-23 13:04:55,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret4 := main(); {120#true} is VALID [2018-11-23 13:04:55,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {122#(= main_~i~0 0)} is VALID [2018-11-23 13:04:55,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(= main_~i~0 0)} assume !(~i~0 < 2048); {121#false} is VALID [2018-11-23 13:04:55,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {121#false} is VALID [2018-11-23 13:04:55,301 INFO L256 TraceCheckUtils]: 8: Hoare triple {121#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {121#false} is VALID [2018-11-23 13:04:55,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#false} ~cond := #in~cond; {121#false} is VALID [2018-11-23 13:04:55,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {121#false} assume 0 == ~cond; {121#false} is VALID [2018-11-23 13:04:55,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2018-11-23 13:04:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:55,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:55,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:55,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:55,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:55,330 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 13:04:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,438 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:55,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:55,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:04:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:04:55,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 13:04:55,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,620 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:04:55,621 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:55,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:04:55,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:55,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:55,642 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:55,643 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,645 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:55,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,646 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:55,646 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,648 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:55,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:55,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:04:55,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:04:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:55,651 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:04:55,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:04:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:04:55,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:55,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 13:04:55,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:04:55,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:04:55,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:04:55,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:04:55,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret4 := main(); {212#true} is VALID [2018-11-23 13:04:55,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-23 13:04:55,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {214#(= main_~i~0 0)} is VALID [2018-11-23 13:04:55,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:55,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 2048); {213#false} is VALID [2018-11-23 13:04:55,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {213#false} is VALID [2018-11-23 13:04:55,811 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {213#false} is VALID [2018-11-23 13:04:55,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:04:55,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:04:55,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:04:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:55,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:55,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:55,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:56,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:04:56,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:04:56,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:04:56,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:04:56,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret4 := main(); {212#true} is VALID [2018-11-23 13:04:56,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:56,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:56,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 2048); {213#false} is VALID [2018-11-23 13:04:56,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {213#false} is VALID [2018-11-23 13:04:56,013 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {213#false} is VALID [2018-11-23 13:04:56,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:04:56,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:04:56,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:04:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:56,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:04:56,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:56,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:56,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:56,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:56,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:56,192 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:04:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,587 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:56,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:56,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2018-11-23 13:04:56,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:56,703 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:04:56,703 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:56,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:04:56,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:56,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:56,756 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:56,756 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,759 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:56,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,760 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:56,760 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,762 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:56,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:56,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:04:56,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:04:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:56,767 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:04:56,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:04:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:04:56,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:56,769 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:56,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:56,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2018-11-23 13:04:56,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:56,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:04:56,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:04:56,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:04:56,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:04:56,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(); {355#true} is VALID [2018-11-23 13:04:56,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {357#(= main_~i~0 0)} is VALID [2018-11-23 13:04:56,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {357#(= main_~i~0 0)} is VALID [2018-11-23 13:04:56,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:56,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 2048); {356#false} is VALID [2018-11-23 13:04:56,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {356#false} is VALID [2018-11-23 13:04:56,926 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {356#false} is VALID [2018-11-23 13:04:56,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:04:56,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:04:56,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:04:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:56,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:56,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:56,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:56,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:56,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:57,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:04:57,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:04:57,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:04:57,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:04:57,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(); {355#true} is VALID [2018-11-23 13:04:57,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 2048); {356#false} is VALID [2018-11-23 13:04:57,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {356#false} is VALID [2018-11-23 13:04:57,127 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {356#false} is VALID [2018-11-23 13:04:57,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:04:57,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:04:57,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:04:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:57,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:57,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:04:57,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:57,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:57,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:04:57,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:57,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:04:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:04:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:57,203 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 13:04:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,417 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:57,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:04:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:04:57,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-11-23 13:04:57,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:57,470 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:04:57,470 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:04:57,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:04:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:04:57,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:57,489 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:57,489 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,491 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:57,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,492 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:57,492 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,494 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:57,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:04:57,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 13:04:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,497 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:04:57,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:04:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:04:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:57,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,498 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:57,499 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2018-11-23 13:04:57,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:04:57,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:04:57,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:04:57,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:04:57,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret4 := main(); {515#true} is VALID [2018-11-23 13:04:57,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {517#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {517#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 2048); {516#false} is VALID [2018-11-23 13:04:57,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {516#false} is VALID [2018-11-23 13:04:57,661 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {516#false} is VALID [2018-11-23 13:04:57,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:04:57,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:04:57,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:04:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:57,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:57,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:57,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:04:57,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:57,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:04:57,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:04:57,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:04:57,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:04:57,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret4 := main(); {515#true} is VALID [2018-11-23 13:04:57,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {539#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {539#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 2048); {516#false} is VALID [2018-11-23 13:04:57,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {516#false} is VALID [2018-11-23 13:04:57,814 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {516#false} is VALID [2018-11-23 13:04:57,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:04:57,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:04:57,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:04:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:57,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:57,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:04:57,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:57,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:57,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:57,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:57,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:57,862 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-23 13:04:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,023 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:04:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:58,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:04:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:04:58,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-23 13:04:58,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:58,092 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:04:58,092 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:04:58,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:04:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:04:58,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:58,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:58,106 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:58,107 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,109 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:58,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,110 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:58,110 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,112 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:58,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:58,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:04:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:04:58,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 13:04:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:58,115 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:04:58,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:04:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:04:58,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:58,116 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:58,117 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:58,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2018-11-23 13:04:58,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:04:58,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:04:58,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:04:58,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:04:58,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret4 := main(); {692#true} is VALID [2018-11-23 13:04:58,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {694#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {694#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 2048); {693#false} is VALID [2018-11-23 13:04:58,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {693#false} is VALID [2018-11-23 13:04:58,278 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {693#false} is VALID [2018-11-23 13:04:58,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:04:58,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:04:58,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:04:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:58,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:58,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:04:58,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:04:58,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:58,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:04:58,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:04:58,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:04:58,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:04:58,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret4 := main(); {692#true} is VALID [2018-11-23 13:04:58,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:58,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {717#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:58,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {717#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 2048); {693#false} is VALID [2018-11-23 13:04:58,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {693#false} is VALID [2018-11-23 13:04:58,498 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {693#false} is VALID [2018-11-23 13:04:58,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:04:58,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:04:58,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:04:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:58,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:04:58,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:58,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:58,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:04:58,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:58,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:04:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:04:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:58,552 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-23 13:04:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,684 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:04:58,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:04:58,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:04:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:04:58,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2018-11-23 13:04:58,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:58,736 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:04:58,737 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:04:58,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:04:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:04:58,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:58,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:58,766 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:58,766 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,767 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:58,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,768 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:58,768 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,770 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:58,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:58,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:04:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:04:58,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-23 13:04:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:58,773 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:04:58,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:04:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:04:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:58,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:58,774 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:58,775 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:58,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2018-11-23 13:04:58,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:58,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:58,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:04:58,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:04:58,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:04:58,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:04:58,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret4 := main(); {886#true} is VALID [2018-11-23 13:04:58,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {888#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {888#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:58,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 2048); {887#false} is VALID [2018-11-23 13:04:58,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {887#false} is VALID [2018-11-23 13:04:58,946 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {887#false} is VALID [2018-11-23 13:04:58,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:04:58,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:04:58,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:04:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:58,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:58,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:04:59,011 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:04:59,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:04:59,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:04:59,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:04:59,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:04:59,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret4 := main(); {886#true} is VALID [2018-11-23 13:04:59,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:59,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {912#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:59,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 2048); {887#false} is VALID [2018-11-23 13:04:59,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {887#false} is VALID [2018-11-23 13:04:59,316 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {887#false} is VALID [2018-11-23 13:04:59,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:04:59,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:04:59,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:04:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:04:59,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:59,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:04:59,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:04:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:04:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:59,392 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-23 13:04:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,550 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:04:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:04:59,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:04:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:04:59,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2018-11-23 13:04:59,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,644 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:04:59,644 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:04:59,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:04:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:04:59,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:59,657 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:59,657 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,659 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:59,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,660 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:59,660 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,662 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:59,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:59,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:04:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:04:59,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-23 13:04:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:59,665 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:04:59,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:04:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:04:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:59,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,666 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,666 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2018-11-23 13:04:59,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:04:59,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:04:59,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:04:59,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:04:59,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret4 := main(); {1097#true} is VALID [2018-11-23 13:04:59,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:04:59,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:04:59,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:59,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1098#false} is VALID [2018-11-23 13:04:59,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1098#false} is VALID [2018-11-23 13:04:59,893 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:04:59,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:04:59,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:04:59,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:04:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:59,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:04:59,950 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:04:59,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:00,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:05:00,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:05:00,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:05:00,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:05:00,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret4 := main(); {1097#true} is VALID [2018-11-23 13:05:00,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:00,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {1124#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:00,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {1124#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1098#false} is VALID [2018-11-23 13:05:00,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1098#false} is VALID [2018-11-23 13:05:00,125 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:05:00,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:05:00,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:05:00,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:05:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:00,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:05:00,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:05:00,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:00,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:05:00,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:00,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:05:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:05:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:00,194 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-23 13:05:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,288 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:05:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:05:00,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:05:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:05:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:05:00,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2018-11-23 13:05:00,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:00,415 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:05:00,415 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:05:00,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:05:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:05:00,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:00,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:05:00,427 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:05:00,427 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:05:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,428 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:05:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:05:00,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,429 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:05:00,429 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:05:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,431 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:05:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:05:00,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:00,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:05:00,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-23 13:05:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:00,433 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:05:00,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:05:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:05:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:05:00,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:00,434 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:00,435 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:00,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2018-11-23 13:05:00,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:00,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:00,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:00,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:05:00,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:05:00,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:05:00,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:05:00,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 13:05:00,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:05:00,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {1327#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:05:00,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {1327#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:00,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1326#false} is VALID [2018-11-23 13:05:00,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1326#false} is VALID [2018-11-23 13:05:00,745 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:05:00,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:05:00,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:05:00,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:05:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:00,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:01,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:05:01,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:05:01,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:05:01,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:05:01,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 13:05:01,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:01,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {1353#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:01,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {1353#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:01,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1326#false} is VALID [2018-11-23 13:05:01,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1326#false} is VALID [2018-11-23 13:05:01,348 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:05:01,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:05:01,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:05:01,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:05:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:01,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:01,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:05:01,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:01,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:01,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:01,421 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-23 13:05:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,688 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:05:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:01,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:05:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:05:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:05:01,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2018-11-23 13:05:01,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,750 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:05:01,750 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:05:01,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:05:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:05:01,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:01,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:05:01,770 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:05:01,770 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:05:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,771 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:05:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:05:01,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,772 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:05:01,772 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:05:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,774 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:05:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:05:01,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:01,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:05:01,777 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 13:05:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:01,777 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:05:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:05:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:05:01,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:01,779 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:01,779 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2018-11-23 13:05:01,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:05:02,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:05:02,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:05:02,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:05:02,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret4 := main(); {1570#true} is VALID [2018-11-23 13:05:02,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {1572#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {1572#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1571#false} is VALID [2018-11-23 13:05:02,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1571#false} is VALID [2018-11-23 13:05:02,032 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:05:02,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:05:02,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:05:02,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:05:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:02,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:02,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:02,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:05:02,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:05:02,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:05:02,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:05:02,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret4 := main(); {1570#true} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1571#false} is VALID [2018-11-23 13:05:02,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1571#false} is VALID [2018-11-23 13:05:02,293 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:05:02,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:05:02,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:05:02,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:05:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:02,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:05:02,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:05:02,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:05:02,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:05:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:05:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:02,346 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-11-23 13:05:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,714 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:05:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:05:02,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:05:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:05:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:05:02,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2018-11-23 13:05:02,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,762 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:05:02,762 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:05:02,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:05:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:05:02,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:02,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 13:05:02,773 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 13:05:02,773 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 13:05:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,775 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:05:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:05:02,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,776 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 13:05:02,776 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 13:05:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,777 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:05:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:05:02,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:02,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:05:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:05:02,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-23 13:05:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:02,779 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:05:02,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:05:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:05:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:05:02,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:02,780 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:02,781 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:02,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2018-11-23 13:05:02,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:02,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:05:03,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:05:03,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:05:03,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:05:03,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret4 := main(); {1832#true} is VALID [2018-11-23 13:05:03,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:05:03,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:05:03,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 2048); {1833#false} is VALID [2018-11-23 13:05:03,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1833#false} is VALID [2018-11-23 13:05:03,046 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:05:03,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:05:03,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:05:03,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:05:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:03,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:05:03,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:03,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:05:03,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:05:03,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:05:03,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:05:03,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret4 := main(); {1832#true} is VALID [2018-11-23 13:05:03,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:03,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {1862#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:03,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {1862#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,411 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 2048); {1833#false} is VALID [2018-11-23 13:05:03,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1833#false} is VALID [2018-11-23 13:05:03,412 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:05:03,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:05:03,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:05:03,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:05:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:03,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:05:03,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:05:03,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:03,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:03,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:03,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:03,470 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-11-23 13:05:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,714 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:05:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:05:03,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:05:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:05:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:05:03,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2018-11-23 13:05:03,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:03,797 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:05:03,798 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:05:03,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:05:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:05:03,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:03,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:05:03,822 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:05:03,823 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:05:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,824 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:05:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:05:03,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,825 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:05:03,825 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:05:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,826 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:05:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:05:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:03,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:05:03,829 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-23 13:05:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:03,829 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:05:03,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:05:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:05:03,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:03,830 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:03,830 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:03,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:03,830 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2018-11-23 13:05:03,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:03,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:03,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:05:04,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:05:04,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:05:04,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:05:04,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret4 := main(); {2111#true} is VALID [2018-11-23 13:05:04,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:05:04,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {2113#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:05:04,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {2113#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2112#false} is VALID [2018-11-23 13:05:04,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2112#false} is VALID [2018-11-23 13:05:04,174 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:05:04,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:05:04,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:05:04,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:05:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:04,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:04,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:04,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:04,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:04,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:05:04,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:05:04,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:05:04,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:05:04,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret4 := main(); {2111#true} is VALID [2018-11-23 13:05:04,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:04,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {2142#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:04,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {2142#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2112#false} is VALID [2018-11-23 13:05:04,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2112#false} is VALID [2018-11-23 13:05:04,388 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:05:04,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:05:04,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:05:04,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:05:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:05:04,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:05:04,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:04,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:04,472 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-11-23 13:05:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,762 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:05:04,762 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:05:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:05:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:05:04,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 13:05:04,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,824 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:05:04,824 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:05:04,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:05:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:05:04,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:04,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:04,843 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:04,843 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,845 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:05:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:05:04,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,845 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 13:05:04,846 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 13:05:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,847 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:05:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:05:04,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:04,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 13:05:04,849 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-23 13:05:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:04,850 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 13:05:04,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:05:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:04,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:04,851 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:04,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2018-11-23 13:05:04,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:05:05,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:05:05,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:05:05,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:05:05,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret4 := main(); {2407#true} is VALID [2018-11-23 13:05:05,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:05:05,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {2409#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:05:05,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {2409#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:05,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:05,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:05,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:05,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:05,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:05,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:05,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:05,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:05,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:05,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:05,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:05,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:05,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:05,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:05,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:05,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:05,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:05,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:05,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:05,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:05,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2408#false} is VALID [2018-11-23 13:05:05,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2408#false} is VALID [2018-11-23 13:05:05,187 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:05:05,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:05:05,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:05:05,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:05:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:05,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:05,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:05,245 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:05:05,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:05,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:05:05,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:05:05,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:05:05,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:05:05,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret4 := main(); {2407#true} is VALID [2018-11-23 13:05:05,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:05,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {2439#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:05,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {2439#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:05,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:05,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:05,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:05,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:05,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:05,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:05,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:05,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:05,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:05,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:05,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:05,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:05,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:05,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:05,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:05,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:05,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:05,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:05,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:05,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:05,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2408#false} is VALID [2018-11-23 13:05:05,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2408#false} is VALID [2018-11-23 13:05:05,413 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:05:05,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:05:05,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:05:05,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:05:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:05,435 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:05,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:05,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:05,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:05,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:05,471 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-23 13:05:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,736 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:05,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:05,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:05:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:05:05,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2018-11-23 13:05:05,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:05,806 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:05:05,806 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:05:05,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:05:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:05:05,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:05,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:05,830 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:05,830 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,831 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:05:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:05:05,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,831 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:05:05,831 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:05:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,832 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:05:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:05:05,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:05,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:05:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-23 13:05:05,834 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-23 13:05:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:05,834 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-23 13:05:05,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:05:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:05:05,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:05,835 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:05,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:05,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2018-11-23 13:05:05,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:05,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:05:06,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:05:06,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:05:06,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:05:06,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret4 := main(); {2720#true} is VALID [2018-11-23 13:05:06,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:05:06,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {2722#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:05:06,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {2722#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 2048); {2721#false} is VALID [2018-11-23 13:05:06,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2721#false} is VALID [2018-11-23 13:05:06,228 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:05:06,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:05:06,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:05:06,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:05:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:06,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:06,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:06,249 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:06,365 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:05:06,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:06,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:05:06,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:05:06,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:05:06,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:05:06,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret4 := main(); {2720#true} is VALID [2018-11-23 13:05:06,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:06,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {2753#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:06,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,513 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 2048); {2721#false} is VALID [2018-11-23 13:05:06,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2721#false} is VALID [2018-11-23 13:05:06,518 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:05:06,519 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:05:06,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:05:06,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:05:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:05:06,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:05:06,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:06,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:05:06,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:05:06,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:05:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:06,613 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-11-23 13:05:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,807 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:06,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:06,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:05:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:05:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:05:06,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2018-11-23 13:05:06,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,917 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:05:06,917 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:05:06,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:05:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:05:06,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:06,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:06,936 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:06,936 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,937 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:05:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:05:06,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,938 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:05:06,938 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:05:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,939 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:05:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:05:06,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:06,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:05:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:05:06,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-23 13:05:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:06,940 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:05:06,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:05:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:05:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:05:06,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:06,941 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:06,941 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:06,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:06,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2018-11-23 13:05:06,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:06,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:06,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:06,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:05:07,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:05:07,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:05:07,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:05:07,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret4 := main(); {3050#true} is VALID [2018-11-23 13:05:07,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:05:07,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {3052#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:05:07,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {3052#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,778 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,785 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,787 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:07,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3051#false} is VALID [2018-11-23 13:05:07,788 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3051#false} is VALID [2018-11-23 13:05:07,788 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:05:07,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:05:07,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:05:07,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:05:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:07,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:07,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:08,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:05:08,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:05:08,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:05:08,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:05:08,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret4 := main(); {3050#true} is VALID [2018-11-23 13:05:08,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:08,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {3084#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:08,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {3084#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:08,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3051#false} is VALID [2018-11-23 13:05:08,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3051#false} is VALID [2018-11-23 13:05:08,033 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:05:08,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:05:08,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:05:08,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:05:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:08,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:08,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:05:08,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:08,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:08,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:08,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:08,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:08,101 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-11-23 13:05:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,416 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:08,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:08,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:05:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:05:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:05:08,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2018-11-23 13:05:08,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:08,471 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:05:08,472 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:05:08,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:05:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:05:08,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:08,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:08,497 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:08,497 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,498 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:05:08,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,498 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 13:05:08,499 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 13:05:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,500 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:05:08,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:08,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:05:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 13:05:08,501 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-23 13:05:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:08,502 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 13:05:08,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:05:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:05:08,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:08,503 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:08,503 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:08,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2018-11-23 13:05:08,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:08,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:08,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:08,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:05:08,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:05:08,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:05:08,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:05:08,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret4 := main(); {3397#true} is VALID [2018-11-23 13:05:08,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:05:08,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {3399#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:05:08,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {3399#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,974 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:08,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:08,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:08,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 2048); {3398#false} is VALID [2018-11-23 13:05:08,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3398#false} is VALID [2018-11-23 13:05:08,977 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:05:08,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:05:08,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:05:08,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:05:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:08,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:08,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:09,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:09,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:09,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:09,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:09,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:05:09,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:05:09,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:05:09,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:05:09,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret4 := main(); {3397#true} is VALID [2018-11-23 13:05:09,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:09,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {3432#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:09,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {3432#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:09,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:09,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:09,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:09,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:09,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:09,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:09,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:09,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:09,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:09,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:09,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:09,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:09,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:09,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:09,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:09,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:09,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:09,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:09,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:09,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:09,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:09,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:09,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:09,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:09,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:09,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:09,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 2048); {3398#false} is VALID [2018-11-23 13:05:09,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3398#false} is VALID [2018-11-23 13:05:09,167 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:05:09,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:05:09,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:05:09,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:05:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:05:09,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:05:09,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:09,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:05:09,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:05:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:05:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:09,305 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-11-23 13:05:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,548 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:05:09,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:05:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:05:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:05:09,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2018-11-23 13:05:09,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,962 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:05:09,962 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:05:09,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:05:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:05:09,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:09,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:09,982 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:09,982 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,984 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:05:09,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,984 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 13:05:09,984 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 13:05:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,985 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:05:09,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:09,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:05:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 13:05:09,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-23 13:05:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:09,988 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 13:05:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:05:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:05:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:05:09,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:09,989 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:09,989 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:09,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2018-11-23 13:05:09,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:05:10,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:05:10,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:05:10,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:05:10,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret4 := main(); {3761#true} is VALID [2018-11-23 13:05:10,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {3763#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {3763#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:10,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 2048); {3762#false} is VALID [2018-11-23 13:05:10,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3762#false} is VALID [2018-11-23 13:05:10,281 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:05:10,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:05:10,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:05:10,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:05:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:10,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:10,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:10,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:10,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:05:10,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:10,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:05:10,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:05:10,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:05:10,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:05:10,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret4 := main(); {3761#true} is VALID [2018-11-23 13:05:10,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:10,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {3797#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:10,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {3797#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:10,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 2048); {3762#false} is VALID [2018-11-23 13:05:10,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3762#false} is VALID [2018-11-23 13:05:10,812 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:05:10,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:05:10,812 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:05:10,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:05:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:05:10,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:05:10,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:10,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:05:10,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:10,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:05:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:05:10,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:10,896 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-11-23 13:05:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,110 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:05:11,110 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:05:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:05:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:05:11,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2018-11-23 13:05:11,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:11,572 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:05:11,573 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:05:11,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:05:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:05:11,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:11,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:11,594 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:11,595 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,596 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:05:11,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:11,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:11,597 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 13:05:11,597 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 13:05:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,598 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:05:11,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:11,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:11,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:11,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:05:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-23 13:05:11,600 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-23 13:05:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-23 13:05:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:05:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:05:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:05:11,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:11,601 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:11,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:11,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2018-11-23 13:05:11,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:11,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:11,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:11,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:11,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:05:11,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:05:11,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:05:11,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:05:11,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret4 := main(); {4142#true} is VALID [2018-11-23 13:05:11,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:05:11,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {4144#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:05:11,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {4144#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:11,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:11,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:11,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:11,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:11,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:11,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:11,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:11,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:11,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:11,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:11,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:11,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:11,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:11,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:11,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:11,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:11,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:11,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:11,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:11,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:11,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:11,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:11,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:11,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:11,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:11,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:11,920 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:11,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:11,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:11,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:11,922 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 2048); {4143#false} is VALID [2018-11-23 13:05:11,922 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4143#false} is VALID [2018-11-23 13:05:11,923 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:05:11,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:05:11,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:05:11,923 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:05:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:11,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:11,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:11,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:11,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:11,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:12,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:05:12,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:05:12,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:05:12,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:05:12,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret4 := main(); {4142#true} is VALID [2018-11-23 13:05:12,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:12,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {4179#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:12,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {4179#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:12,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:12,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:12,133 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:12,133 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:12,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:12,134 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:12,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:12,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:12,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:12,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:12,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:12,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:12,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 2048); {4143#false} is VALID [2018-11-23 13:05:12,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4143#false} is VALID [2018-11-23 13:05:12,138 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:05:12,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:05:12,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:05:12,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:05:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:12,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:12,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:05:12,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:05:12,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:12,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:05:12,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:05:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:05:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:12,208 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-11-23 13:05:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,344 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:05:12,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:05:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:05:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:05:12,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2018-11-23 13:05:12,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,775 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:05:12,775 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:05:12,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:05:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 13:05:12,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:12,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:12,797 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:12,797 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,798 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:05:12,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,799 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 13:05:12,799 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 13:05:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,800 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:05:12,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:12,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:05:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-23 13:05:12,801 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-11-23 13:05:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:12,801 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-23 13:05:12,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:05:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:05:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:05:12,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:12,802 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:12,802 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:12,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2018-11-23 13:05:12,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:05:13,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:05:13,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:05:13,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:05:13,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret4 := main(); {4540#true} is VALID [2018-11-23 13:05:13,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:05:13,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {4542#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:05:13,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {4542#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:13,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:13,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:13,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:13,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:13,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:13,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:13,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:13,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:13,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:13,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:13,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:13,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:13,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:13,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:13,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:13,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:13,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:13,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:13,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:13,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:13,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 2048); {4541#false} is VALID [2018-11-23 13:05:13,210 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4541#false} is VALID [2018-11-23 13:05:13,210 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:05:13,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:05:13,210 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:05:13,211 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:05:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:13,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:13,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:13,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:13,357 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:05:13,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:13,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:05:13,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:05:13,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:05:13,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:05:13,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret4 := main(); {4540#true} is VALID [2018-11-23 13:05:13,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:13,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {4578#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:13,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {4578#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:13,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:13,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:13,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:13,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:13,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:13,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:13,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:13,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:13,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:13,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:13,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:13,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:13,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:13,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:13,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:13,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:13,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:13,584 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:13,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:13,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:13,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 2048); {4541#false} is VALID [2018-11-23 13:05:13,593 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4541#false} is VALID [2018-11-23 13:05:13,593 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:05:13,594 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:05:13,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:05:13,594 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:05:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:13,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:13,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:05:13,615 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:05:13,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:13,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:05:13,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:05:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:05:13,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:05:13,667 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-11-23 13:05:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,985 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:05:13,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:05:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:05:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:05:13,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2018-11-23 13:05:14,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:14,513 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:05:14,513 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:05:14,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:05:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:05:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 13:05:14,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:14,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:14,606 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:14,606 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,607 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:05:14,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,608 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 13:05:14,608 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 13:05:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,610 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:05:14,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:14,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:05:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 13:05:14,612 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-11-23 13:05:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:14,612 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 13:05:14,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:05:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:05:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:05:14,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:14,613 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:14,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:14,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2018-11-23 13:05:14,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:14,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:05:16,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:05:16,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:05:16,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:05:16,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret4 := main(); {4955#true} is VALID [2018-11-23 13:05:16,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:05:16,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {4957#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:05:16,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {4957#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,639 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:16,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 2048); {4956#false} is VALID [2018-11-23 13:05:16,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4956#false} is VALID [2018-11-23 13:05:16,644 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:05:16,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:05:16,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:05:16,645 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:05:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:16,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:17,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:05:17,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:17,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:17,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:05:17,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:05:17,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:05:17,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:05:17,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret4 := main(); {4955#true} is VALID [2018-11-23 13:05:17,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:17,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {4994#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:17,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {4994#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:17,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:17,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:17,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:17,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:17,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:17,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:17,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:17,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:17,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:17,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:17,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:17,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:17,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:17,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:17,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:17,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:17,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:17,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:17,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:17,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:17,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:17,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:17,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:17,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:17,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:17,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:17,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:17,591 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:17,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:17,592 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:17,593 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:17,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:17,594 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:17,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:17,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 2048); {4956#false} is VALID [2018-11-23 13:05:17,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4956#false} is VALID [2018-11-23 13:05:17,596 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:05:17,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:05:17,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:05:17,597 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:05:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:17,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:17,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:05:17,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:05:17,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:17,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:05:17,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:17,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:05:17,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:05:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:05:17,676 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-11-23 13:05:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,276 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:05:18,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:05:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:05:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:05:18,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 58 transitions. [2018-11-23 13:05:18,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:18,353 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:05:18,353 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:05:18,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:05:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:05:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 13:05:18,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:18,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:18,384 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:18,384 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,386 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:05:18,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:18,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:18,386 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 13:05:18,387 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 13:05:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,388 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:05:18,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:18,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:18,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:18,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:05:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 13:05:18,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-11-23 13:05:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:18,391 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 13:05:18,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:05:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:05:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:05:18,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:18,392 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:18,392 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:18,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2018-11-23 13:05:18,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:18,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:18,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:18,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:19,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:05:19,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:05:19,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:05:19,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:05:19,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret4 := main(); {5387#true} is VALID [2018-11-23 13:05:19,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:05:19,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {5389#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:05:19,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {5389#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,567 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,569 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,570 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:19,572 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 2048); {5388#false} is VALID [2018-11-23 13:05:19,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5388#false} is VALID [2018-11-23 13:05:19,572 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:05:19,572 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:05:19,573 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:05:19,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:05:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:19,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:19,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:19,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:19,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:05:19,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:05:19,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:05:19,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:05:19,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret4 := main(); {5387#true} is VALID [2018-11-23 13:05:19,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:19,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {5427#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:19,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {5427#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,808 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:19,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 2048); {5388#false} is VALID [2018-11-23 13:05:19,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5388#false} is VALID [2018-11-23 13:05:19,813 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:05:19,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:05:19,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:05:19,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:05:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:05:19,835 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:05:19,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:19,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:05:19,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:19,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:05:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:05:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:05:19,905 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-11-23 13:05:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,103 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:20,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:05:20,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:05:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:05:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:05:20,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 60 transitions. [2018-11-23 13:05:20,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:20,167 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:05:20,167 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:05:20,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:05:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:05:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:05:20,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:20,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:20,262 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:20,262 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,263 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:05:20,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:20,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:20,264 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:05:20,264 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:05:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,265 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:05:20,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:20,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:20,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:20,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:05:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-23 13:05:20,266 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-11-23 13:05:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:20,267 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-23 13:05:20,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:05:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:05:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:05:20,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:20,268 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:20,268 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:20,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2018-11-23 13:05:20,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:21,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:05:21,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:05:21,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:05:21,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:05:21,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret4 := main(); {5836#true} is VALID [2018-11-23 13:05:21,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:05:21,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {5838#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:05:21,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {5838#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,094 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,101 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:21,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 2048); {5837#false} is VALID [2018-11-23 13:05:21,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5837#false} is VALID [2018-11-23 13:05:21,103 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:05:21,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:05:21,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:05:21,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:05:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:21,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:21,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:21,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:21,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:21,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:21,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:05:21,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:05:21,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:05:21,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:05:21,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret4 := main(); {5836#true} is VALID [2018-11-23 13:05:21,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:21,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {5877#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:21,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {5877#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:21,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 2048); {5837#false} is VALID [2018-11-23 13:05:21,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5837#false} is VALID [2018-11-23 13:05:21,516 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:05:21,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:05:21,517 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:05:21,517 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:05:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:05:21,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:05:21,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:21,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:05:21,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:05:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:05:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:05:21,598 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-11-23 13:05:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:21,766 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:05:21,766 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:05:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:05:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:05:21,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2018-11-23 13:05:22,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:22,208 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:05:22,208 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:05:22,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:05:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:05:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 13:05:22,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:22,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:22,228 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:22,228 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:22,229 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:05:22,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:22,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:22,229 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 13:05:22,230 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 13:05:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:22,230 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:05:22,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:22,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:22,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:22,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:05:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 13:05:22,234 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-11-23 13:05:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:22,234 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 13:05:22,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:05:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:05:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:05:22,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:22,235 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:22,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:22,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2018-11-23 13:05:22,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:22,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:22,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:22,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:22,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:05:22,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:05:22,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:05:22,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:05:22,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret4 := main(); {6302#true} is VALID [2018-11-23 13:05:22,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:05:22,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {6304#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:05:22,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {6304#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:22,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:22,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:22,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:22,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:22,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:22,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:22,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:22,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:22,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:22,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:22,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:22,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:22,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:22,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:22,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:22,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:22,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:22,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:22,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:22,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:22,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:22,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:22,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:22,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:22,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:22,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:22,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:22,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:22,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:22,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:22,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:22,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:22,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:22,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:22,690 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:22,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:22,691 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:22,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:22,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:22,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:22,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 2048); {6303#false} is VALID [2018-11-23 13:05:22,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6303#false} is VALID [2018-11-23 13:05:22,694 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:05:22,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:05:22,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:05:22,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:05:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:22,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:22,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:22,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:05:24,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:24,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:24,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:05:24,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:05:24,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:05:24,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:05:24,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret4 := main(); {6302#true} is VALID [2018-11-23 13:05:24,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:24,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {6344#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:24,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {6344#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:24,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:24,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:24,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:24,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:24,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:24,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:24,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:24,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:24,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:24,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:24,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:24,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:24,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:24,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:24,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:24,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:24,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:24,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:24,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:24,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:24,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:24,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:24,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:24,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:24,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:24,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:24,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:24,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:24,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:24,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:24,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:24,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:24,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:24,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:24,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:24,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:24,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:24,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:24,938 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:24,938 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:24,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 2048); {6303#false} is VALID [2018-11-23 13:05:24,939 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6303#false} is VALID [2018-11-23 13:05:24,939 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:05:24,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:05:24,940 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:05:24,940 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:05:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:24,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:24,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:05:24,964 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:05:24,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:24,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:05:25,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:05:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:05:25,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:05:25,023 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-11-23 13:05:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,391 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:05:25,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:05:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:05:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:05:25,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 13:05:25,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:25,455 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:05:25,455 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:05:25,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:05:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:05:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:05:25,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:25,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:25,486 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:25,486 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,488 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:05:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:25,488 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:05:25,489 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:05:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,489 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:05:25,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:25,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:25,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:25,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:05:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 13:05:25,491 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-11-23 13:05:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 13:05:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:05:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:05:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:05:25,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:25,492 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:25,492 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:25,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2018-11-23 13:05:25,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:25,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:25,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:05:25,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:05:25,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:05:25,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:05:25,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret4 := main(); {6785#true} is VALID [2018-11-23 13:05:25,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:25,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {6787#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:25,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {6787#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,917 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,918 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:25,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 2048); {6786#false} is VALID [2018-11-23 13:05:25,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6786#false} is VALID [2018-11-23 13:05:25,921 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:05:25,922 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:05:25,922 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:05:25,922 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:05:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:25,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:25,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:25,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:25,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:25,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:26,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:05:26,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:05:26,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:05:26,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:05:26,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret4 := main(); {6785#true} is VALID [2018-11-23 13:05:26,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:26,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {6828#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:26,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {6828#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:26,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:26,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:26,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:26,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:26,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:26,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:26,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:26,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:26,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:26,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:26,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:26,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:26,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:26,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:26,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:26,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:26,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:26,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:26,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:26,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:26,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:26,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:26,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:26,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:26,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:26,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:26,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:26,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:26,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:26,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:26,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:26,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:26,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:26,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:26,404 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:26,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:26,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:26,406 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:26,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:26,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:26,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:26,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:26,412 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 2048); {6786#false} is VALID [2018-11-23 13:05:26,412 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6786#false} is VALID [2018-11-23 13:05:26,412 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:05:26,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:05:26,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:05:26,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:05:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:26,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:26,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:05:26,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:05:26,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:26,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:05:26,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:26,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:05:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:05:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:05:26,527 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-11-23 13:05:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,847 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:05:26,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:05:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:05:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:05:26,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2018-11-23 13:05:26,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:26,922 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:05:26,923 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:05:26,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:05:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:05:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 13:05:26,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:26,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:26,943 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:26,943 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,944 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:05:26,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,944 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 13:05:26,945 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 13:05:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,946 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:05:26,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:26,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:05:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-23 13:05:26,947 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-11-23 13:05:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:26,947 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-23 13:05:26,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:05:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:05:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:05:26,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:26,948 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:26,948 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:26,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2018-11-23 13:05:26,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:26,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:05:27,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:05:27,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:05:27,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:05:27,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret4 := main(); {7285#true} is VALID [2018-11-23 13:05:27,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:05:27,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {7287#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:05:27,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {7287#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,340 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,342 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,346 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,346 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,350 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 2048); {7286#false} is VALID [2018-11-23 13:05:27,350 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7286#false} is VALID [2018-11-23 13:05:27,350 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:05:27,351 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:05:27,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:05:27,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:05:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:27,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:27,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:27,381 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:27,680 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 13:05:27,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:27,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:05:27,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:05:27,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:05:27,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:05:27,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret4 := main(); {7285#true} is VALID [2018-11-23 13:05:27,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:27,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {7329#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:27,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {7329#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,897 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,898 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,899 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,900 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,901 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 2048); {7286#false} is VALID [2018-11-23 13:05:27,901 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7286#false} is VALID [2018-11-23 13:05:27,901 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:05:27,902 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:05:27,902 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:05:27,902 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:05:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:27,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:27,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:05:27,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:05:27,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:27,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:05:27,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:05:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:05:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:05:27,985 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-11-23 13:05:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,246 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:05:28,247 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:05:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:05:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:05:28,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2018-11-23 13:05:28,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:28,315 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:05:28,316 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:05:28,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:05:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:05:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 13:05:28,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:28,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:28,506 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:28,506 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,508 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:05:28,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:28,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:28,509 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 13:05:28,509 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 13:05:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,510 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:05:28,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:28,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:28,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:28,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:05:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-23 13:05:28,512 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-11-23 13:05:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:28,512 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-23 13:05:28,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:05:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:05:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:05:28,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:28,513 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:28,514 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:28,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2018-11-23 13:05:28,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:28,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:28,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:29,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:05:29,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:05:29,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:05:29,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:05:29,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret4 := main(); {7802#true} is VALID [2018-11-23 13:05:29,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:05:29,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {7804#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:05:29,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {7804#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:29,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:29,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:29,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:29,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:29,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:29,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:29,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:29,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:29,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:29,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:29,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:29,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:29,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:29,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:29,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:29,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:29,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:29,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:29,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:29,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:29,340 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:29,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:29,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:29,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:29,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:29,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:29,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:29,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:29,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:29,346 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:29,346 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:29,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:29,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:29,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:29,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:29,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:29,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:29,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:29,351 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:29,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:29,352 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:29,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:29,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:29,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:29,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:29,355 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:29,356 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 2048); {7803#false} is VALID [2018-11-23 13:05:29,356 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7803#false} is VALID [2018-11-23 13:05:29,356 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:05:29,357 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:05:29,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:05:29,357 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:05:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:29,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:29,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:31,543 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 13:05:31,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:31,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:31,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:05:31,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:05:31,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:05:31,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:05:31,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret4 := main(); {7802#true} is VALID [2018-11-23 13:05:31,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:31,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {7847#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:31,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {7847#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:31,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:31,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:31,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:31,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:31,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:31,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:31,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:31,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:31,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:31,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:31,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:31,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:31,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:31,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:31,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:31,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:31,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:31,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:31,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:31,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:31,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:31,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:31,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:31,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:31,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:31,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:31,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:31,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:31,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:31,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:31,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:31,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:31,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:31,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:31,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:31,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:31,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:31,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:31,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:31,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:31,809 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:31,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:31,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:31,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:31,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:31,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:31,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 2048); {7803#false} is VALID [2018-11-23 13:05:31,813 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7803#false} is VALID [2018-11-23 13:05:31,813 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:05:31,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:05:31,814 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:05:31,814 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:05:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:31,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 13:05:31,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:05:31,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:31,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:05:31,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:31,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:05:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:05:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:05:31,901 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-11-23 13:05:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,224 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:05:32,225 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:05:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:05:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:05:32,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 70 transitions. [2018-11-23 13:05:32,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:32,297 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:05:32,298 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:05:32,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:05:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:05:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-23 13:05:32,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:32,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:32,319 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:32,319 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,320 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:05:32,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:32,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:32,320 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 64 states. [2018-11-23 13:05:32,321 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 64 states. [2018-11-23 13:05:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,321 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:05:32,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:32,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:32,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:32,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:05:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-23 13:05:32,323 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-11-23 13:05:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:32,324 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-23 13:05:32,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:05:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-23 13:05:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:05:32,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:32,325 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:32,325 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:32,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2018-11-23 13:05:32,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:32,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:32,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:32,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:33,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:05:33,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:33,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:05:33,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret4 := main(); {8336#true} is VALID [2018-11-23 13:05:33,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {8338#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {8338#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,154 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,157 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,158 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,162 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,163 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,163 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,165 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:33,166 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 2048); {8337#false} is VALID [2018-11-23 13:05:33,166 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8337#false} is VALID [2018-11-23 13:05:33,166 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:33,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:33,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:33,167 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:33,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:33,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:33,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:33,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:33,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:05:33,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:33,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:05:33,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret4 := main(); {8336#true} is VALID [2018-11-23 13:05:33,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:33,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {8382#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:33,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {8382#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,497 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,557 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,617 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:33,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 2048); {8337#false} is VALID [2018-11-23 13:05:33,643 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8337#false} is VALID [2018-11-23 13:05:33,643 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:33,643 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:33,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:33,644 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:05:33,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:05:33,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:33,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:05:33,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:33,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:05:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:05:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:33,971 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-11-23 13:05:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:34,375 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:05:34,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:05:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:05:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:05:34,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 72 transitions. [2018-11-23 13:05:34,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:34,447 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:05:34,448 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:05:34,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:05:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 13:05:34,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:34,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:34,471 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:34,471 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:34,472 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:05:34,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:34,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:34,474 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 13:05:34,474 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 13:05:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:34,475 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:05:34,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:34,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:34,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:34,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:05:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-23 13:05:34,477 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-11-23 13:05:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:34,477 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-23 13:05:34,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:05:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-23 13:05:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:05:34,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:34,478 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:34,478 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:34,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2018-11-23 13:05:34,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:34,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:36,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:05:36,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:05:36,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:05:36,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:05:36,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret4 := main(); {8887#true} is VALID [2018-11-23 13:05:36,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:05:36,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {8889#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:05:36,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {8889#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,111 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:36,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 2048); {8888#false} is VALID [2018-11-23 13:05:36,118 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8888#false} is VALID [2018-11-23 13:05:36,118 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:05:36,118 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:05:36,118 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:05:36,119 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:05:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:36,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:36,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:36,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:36,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:36,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:36,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:36,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:05:36,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:05:36,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:05:36,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:05:36,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret4 := main(); {8887#true} is VALID [2018-11-23 13:05:36,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:36,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {8934#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:36,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {8934#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,403 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:36,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 2048); {8888#false} is VALID [2018-11-23 13:05:36,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8888#false} is VALID [2018-11-23 13:05:36,422 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:05:36,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:05:36,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:05:36,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:05:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:36,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:36,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 13:05:36,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:05:36,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:36,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:05:36,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:36,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:05:36,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:05:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:05:36,557 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-11-23 13:05:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:36,983 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:05:36,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:05:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:05:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:05:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:05:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:05:36,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 74 transitions. [2018-11-23 13:05:37,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:37,079 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:05:37,079 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:05:37,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:05:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:05:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 13:05:37,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:37,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:37,108 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:37,108 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:37,109 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:05:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:37,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:37,110 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 13:05:37,110 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 13:05:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:37,111 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:05:37,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:37,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:37,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:37,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:05:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-23 13:05:37,114 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-11-23 13:05:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:37,114 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-23 13:05:37,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:05:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-23 13:05:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:05:37,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:37,115 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:37,116 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:37,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2018-11-23 13:05:37,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:37,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:37,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:37,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:37,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:37,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:05:37,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:05:37,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:05:37,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:05:37,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret4 := main(); {9455#true} is VALID [2018-11-23 13:05:37,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:37,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {9457#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:37,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {9457#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:37,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:37,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:37,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:37,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:37,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:37,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:37,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:37,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:37,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:37,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:37,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:37,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:37,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:37,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:37,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:37,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:37,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:37,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:37,626 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:37,627 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:37,627 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:37,628 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:37,628 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:37,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:37,630 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:37,630 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:37,631 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:37,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:37,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:37,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:37,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:37,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:37,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:37,635 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:37,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:37,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:37,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:37,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:37,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:37,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:37,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:37,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:37,640 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:37,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:37,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:37,642 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:37,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:37,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:37,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:37,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:37,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:37,646 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:37,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 2048); {9456#false} is VALID [2018-11-23 13:05:37,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9456#false} is VALID [2018-11-23 13:05:37,647 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:05:37,647 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:05:37,647 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:05:37,647 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:05:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:37,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:37,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:37,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:42,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 13:05:42,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:42,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:42,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:05:42,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:05:42,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:05:42,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:05:42,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret4 := main(); {9455#true} is VALID [2018-11-23 13:05:42,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:42,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:42,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:42,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:42,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:42,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:42,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:42,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:42,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:42,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:42,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:42,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:42,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:42,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:42,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:42,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:42,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:42,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:42,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:42,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:42,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:42,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:42,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:42,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:42,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:42,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:42,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:42,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:42,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:42,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:42,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:42,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:42,807 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:42,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:42,808 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:42,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:42,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:42,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:42,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:42,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:42,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:42,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:42,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:42,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:42,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:42,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:42,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:42,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:42,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:42,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:42,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:42,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:42,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:42,820 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:42,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:42,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 2048); {9456#false} is VALID [2018-11-23 13:05:42,822 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9456#false} is VALID [2018-11-23 13:05:42,822 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:05:42,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:05:42,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:05:42,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:05:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:42,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:42,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:05:42,849 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:05:42,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:42,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:05:42,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:42,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:05:42,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:05:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:05:42,918 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-11-23 13:05:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,191 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:05:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:05:43,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:05:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:05:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:05:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:05:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:05:43,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2018-11-23 13:05:43,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:43,271 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:05:43,272 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:05:43,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:05:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:05:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 13:05:43,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:43,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:43,299 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:43,299 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,300 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:05:43,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 13:05:43,302 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 13:05:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,302 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:05:43,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:43,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:05:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-23 13:05:43,304 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-11-23 13:05:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:43,304 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-23 13:05:43,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:05:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-23 13:05:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:05:43,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:43,305 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:43,305 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2018-11-23 13:05:43,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:43,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:05:43,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:05:43,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:05:43,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:05:43,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret4 := main(); {10040#true} is VALID [2018-11-23 13:05:43,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:05:43,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {10042#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:05:43,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {10042#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:43,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:43,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:43,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:43,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:43,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:43,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:43,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:43,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:43,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:43,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:43,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:43,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:43,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:43,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:43,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:43,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:43,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:43,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:43,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:43,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:43,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:43,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:43,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:43,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:43,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:43,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:43,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:43,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:43,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:43,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:43,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:43,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:43,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:43,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:43,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:43,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:43,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:43,894 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:43,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:43,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:43,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:43,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:43,897 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:43,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:43,898 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:43,899 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:43,899 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:43,900 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:43,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:43,901 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:43,902 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:43,902 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:43,903 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:43,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:43,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 2048); {10041#false} is VALID [2018-11-23 13:05:43,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10041#false} is VALID [2018-11-23 13:05:43,905 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:05:43,905 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:05:43,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:05:43,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:05:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:43,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:43,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:43,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:43,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:43,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:44,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:05:44,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:05:44,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:05:44,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:05:44,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret4 := main(); {10040#true} is VALID [2018-11-23 13:05:44,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:44,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {10089#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:44,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {10089#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,245 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,247 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,255 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,262 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,264 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:44,271 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 2048); {10041#false} is VALID [2018-11-23 13:05:44,271 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10041#false} is VALID [2018-11-23 13:05:44,271 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:05:44,271 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:05:44,271 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:05:44,272 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:05:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:44,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:44,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 13:05:44,296 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:05:44,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:44,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:05:44,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:44,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:05:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:05:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:05:44,366 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-11-23 13:05:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:44,729 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:05:44,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:05:44,729 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:05:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:05:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:05:44,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2018-11-23 13:05:44,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:44,813 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:05:44,814 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:05:44,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:05:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:05:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 13:05:44,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:44,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:44,837 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:44,837 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:44,838 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:05:44,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:44,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:44,839 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 13:05:44,839 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 13:05:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:44,840 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:05:44,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:44,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:44,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:44,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:05:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-23 13:05:44,842 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-11-23 13:05:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:44,842 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-23 13:05:44,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:05:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-23 13:05:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:05:44,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:44,843 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:44,844 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:44,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2018-11-23 13:05:44,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:44,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:44,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:44,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:44,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:45,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:05:45,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:05:45,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:05:45,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:05:45,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret4 := main(); {10642#true} is VALID [2018-11-23 13:05:45,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:05:45,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {10644#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:05:45,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {10644#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:45,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:45,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:45,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:45,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:45,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:45,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:45,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:45,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:45,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:45,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:45,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:45,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:45,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:45,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:45,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:45,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:45,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:45,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:45,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:45,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:45,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:45,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:45,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:45,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:45,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:45,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:45,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:45,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:45,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:45,559 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:45,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:45,561 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:45,561 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:45,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:45,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:45,563 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:45,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:45,564 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:45,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:45,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:45,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:45,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:45,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:45,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:45,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:45,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:45,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:45,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:45,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:45,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:45,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:45,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:45,574 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:45,575 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:45,575 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:45,576 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:45,577 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 2048); {10643#false} is VALID [2018-11-23 13:05:45,577 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10643#false} is VALID [2018-11-23 13:05:45,577 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:05:45,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:05:45,577 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:05:45,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:05:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:45,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:45,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:45,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:48,314 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 13:05:48,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:48,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:48,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:05:48,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:05:48,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:05:48,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:05:48,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret4 := main(); {10642#true} is VALID [2018-11-23 13:05:48,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:48,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {10692#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:48,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:48,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:48,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:48,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:48,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:48,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:48,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:48,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:48,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:48,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:48,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:48,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:48,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:48,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:48,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:48,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:48,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:48,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:48,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:48,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:48,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:48,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:48,571 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:48,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:48,572 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:48,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:48,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:48,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:48,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:48,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:48,576 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:48,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:48,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:48,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:48,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:48,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:48,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:48,580 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:48,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:48,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:48,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:48,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:48,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:48,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:48,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:48,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:48,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:48,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:48,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:48,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:48,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:48,589 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:48,590 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:48,590 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:48,591 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:48,591 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:48,592 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:48,593 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 2048); {10643#false} is VALID [2018-11-23 13:05:48,593 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10643#false} is VALID [2018-11-23 13:05:48,593 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:05:48,594 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:05:48,594 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:05:48,594 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:05:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 13:05:48,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:05:48,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:48,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:05:48,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:48,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:05:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:05:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:05:48,712 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-11-23 13:05:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:49,199 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:05:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:05:49,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:05:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:05:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:05:49,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2018-11-23 13:05:49,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:49,409 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:05:49,409 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:05:49,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:05:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:05:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 13:05:49,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:49,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:49,444 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:49,444 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:49,446 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:05:49,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:49,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:49,446 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 13:05:49,446 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 13:05:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:49,447 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:05:49,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:49,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:49,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:49,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:05:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-11-23 13:05:49,449 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-11-23 13:05:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-11-23 13:05:49,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:05:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-23 13:05:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:05:49,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:49,449 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:49,450 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:49,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2018-11-23 13:05:49,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:49,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:50,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:05:50,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:05:50,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:05:50,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:05:50,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret4 := main(); {11261#true} is VALID [2018-11-23 13:05:50,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:05:50,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {11263#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:05:50,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {11263#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:50,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:50,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:50,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:50,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:50,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:50,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:50,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:50,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:50,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:50,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:50,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:50,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:50,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:50,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:50,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:50,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:50,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:50,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:50,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:50,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:50,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:50,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:50,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:50,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:50,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:50,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:50,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:50,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:50,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:50,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:50,229 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:50,230 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:50,230 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:50,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:50,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:50,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:50,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:50,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:50,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:50,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:50,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:50,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:50,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:50,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:50,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:50,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:50,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:50,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:50,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:50,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:50,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:50,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:50,243 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:50,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:50,244 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:50,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:50,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:50,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:50,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 2048); {11262#false} is VALID [2018-11-23 13:05:50,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11262#false} is VALID [2018-11-23 13:05:50,247 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:05:50,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:05:50,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:05:50,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:05:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:50,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:50,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:06,561 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 13:06:06,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:06,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:06,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:06:06,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:06:06,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:06:06,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:06:06,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret4 := main(); {11261#true} is VALID [2018-11-23 13:06:06,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:06,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {11312#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:06,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {11312#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:06,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:06,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:06,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:06,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:06,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:06,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:06,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:06,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:06,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:06,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:06,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:06,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:06,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:06,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:06,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:06,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:06,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:06,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:06,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:06,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:06,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:06,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:06,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:06,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:06,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:06,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:06,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:06,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:06,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:06,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:06,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:06,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:06,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:06,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:06,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:06,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:06,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:06,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:06,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:06,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:06,816 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:06,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:06,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:06,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:06,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:06,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:06,819 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:06,820 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:06,821 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:06,821 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:06,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:06,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:06,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:06,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:06,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:06,825 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:06,826 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:06,826 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:06,827 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 2048); {11262#false} is VALID [2018-11-23 13:06:06,827 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11262#false} is VALID [2018-11-23 13:06:06,828 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:06:06,828 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:06:06,828 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:06:06,828 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:06:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:06,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:06,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 13:06:06,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:06:06,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:06,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:06:06,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:06,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:06:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:06:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:06:06,974 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-11-23 13:06:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,618 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:06:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:06:07,619 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:06:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:06:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:06:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:06:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:06:07,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 82 transitions. [2018-11-23 13:06:07,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:07,735 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:06:07,736 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:06:07,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:06:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:06:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:06:07,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:07,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 13:06:07,762 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 13:06:07,762 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 13:06:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,763 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:06:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:06:07,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,764 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 13:06:07,764 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 13:06:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,765 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:06:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:06:07,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:07,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:06:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-23 13:06:07,767 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-11-23 13:06:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:07,768 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-23 13:06:07,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:06:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-23 13:06:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 13:06:07,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:07,769 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:07,769 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2018-11-23 13:06:07,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:06:08,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:06:08,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:06:08,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:06:08,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret4 := main(); {11897#true} is VALID [2018-11-23 13:06:08,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:06:08,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {11899#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:06:08,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {11899#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:08,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:08,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:08,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:08,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:08,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:08,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:08,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:08,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:08,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:08,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:08,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:08,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:08,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:08,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:08,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:08,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:08,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:08,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:08,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:08,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:08,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:08,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:08,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:08,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:08,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:08,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:08,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:08,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:08,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:08,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:08,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:08,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:08,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:08,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:08,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:08,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:08,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:08,373 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:08,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:08,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:08,375 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:08,375 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:08,376 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:08,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:08,377 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:08,378 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:08,378 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:08,379 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:08,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:08,380 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:08,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:08,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:08,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:08,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:08,383 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:08,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:08,384 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:08,385 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:08,386 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:08,386 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:08,387 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 2048); {11898#false} is VALID [2018-11-23 13:06:08,387 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11898#false} is VALID [2018-11-23 13:06:08,387 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:06:08,387 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:06:08,388 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:06:08,388 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:06:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:08,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:08,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:08,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:06:08,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:06:08,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:06:08,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:06:08,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret4 := main(); {11897#true} is VALID [2018-11-23 13:06:08,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:08,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {11949#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:08,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {11949#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:08,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:08,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:08,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:08,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:08,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:08,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:08,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:08,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:08,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:08,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:08,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:08,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:08,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:08,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:08,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:08,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:08,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:08,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:08,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:08,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:08,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:08,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:08,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:08,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:08,705 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:08,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:08,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:08,707 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:08,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:08,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:08,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:08,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:08,710 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:08,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:08,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:08,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:08,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:08,741 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:08,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:08,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:08,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:08,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:08,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:08,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:08,743 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:08,744 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:08,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:08,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:08,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:08,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:08,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:08,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:08,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:08,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:08,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:08,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:08,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:08,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:08,752 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:08,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:08,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 2048); {11898#false} is VALID [2018-11-23 13:06:08,754 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11898#false} is VALID [2018-11-23 13:06:08,754 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:06:08,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:06:08,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:06:08,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:06:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:08,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 13:06:08,780 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:06:08,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:08,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:06:08,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:08,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:06:08,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:06:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:06:08,860 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-11-23 13:06:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,266 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:06:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:06:09,267 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:06:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:06:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:06:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:06:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:06:09,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 84 transitions. [2018-11-23 13:06:09,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:09,353 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:06:09,353 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:06:09,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:06:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:06:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 13:06:09,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:09,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 13:06:09,381 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 13:06:09,381 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 13:06:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,383 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:06:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:06:09,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:09,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:09,383 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 13:06:09,384 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 13:06:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,385 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:06:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:06:09,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:09,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:09,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:09,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:06:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-23 13:06:09,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-11-23 13:06:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:09,387 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-23 13:06:09,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:06:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-23 13:06:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:06:09,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:09,388 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:09,388 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2018-11-23 13:06:09,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:11,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:06:11,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:06:11,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:06:11,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:06:11,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret4 := main(); {12550#true} is VALID [2018-11-23 13:06:11,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:06:11,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {12552#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:06:11,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {12552#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:11,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:11,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:11,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:11,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:11,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:11,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:11,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:11,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:11,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:11,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:11,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:11,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:11,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:11,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:11,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:11,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:11,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:11,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:11,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:11,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:11,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:11,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:11,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:11,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:11,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:11,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:11,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:11,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:11,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:11,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:11,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:11,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:11,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:11,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:11,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:11,147 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:11,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:11,148 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:11,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:11,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:11,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:11,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:11,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:11,150 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:11,151 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:11,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:11,151 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:11,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:11,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:11,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:11,154 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:11,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:11,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:11,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:11,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:11,157 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:11,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:11,158 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:11,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:11,159 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:11,160 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:11,160 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:11,161 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 2048); {12551#false} is VALID [2018-11-23 13:06:11,161 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12551#false} is VALID [2018-11-23 13:06:11,161 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:06:11,162 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:06:11,162 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:06:11,162 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:06:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:11,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:11,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:11,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:11,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:11,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:11,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:11,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:06:11,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:06:11,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:06:11,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:06:11,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret4 := main(); {12550#true} is VALID [2018-11-23 13:06:11,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:11,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {12603#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:11,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {12603#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:11,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:11,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:11,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:11,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:11,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:11,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:11,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:11,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:11,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:11,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:11,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:11,463 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:11,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:11,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:11,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:11,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:11,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:11,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:11,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:11,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:11,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:11,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:11,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:11,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:11,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:11,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:11,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:11,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:11,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:11,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:11,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:11,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:11,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:11,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:11,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:11,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:11,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:11,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:11,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:11,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:11,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:11,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:11,483 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:11,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:11,484 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:11,485 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:11,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:11,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:11,486 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:11,487 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:11,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:11,488 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:11,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:11,490 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:11,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:11,496 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:11,497 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:11,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:11,498 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:11,498 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:11,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:11,499 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:11,500 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 2048); {12551#false} is VALID [2018-11-23 13:06:11,500 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12551#false} is VALID [2018-11-23 13:06:11,500 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:06:11,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:06:11,500 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:06:11,500 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:06:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:11,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:11,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 13:06:11,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:06:11,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:11,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:06:11,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:11,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:06:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:06:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:06:11,607 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-11-23 13:06:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,048 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:06:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:06:12,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:06:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:06:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:06:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:06:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:06:12,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 86 transitions. [2018-11-23 13:06:12,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:12,145 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:06:12,145 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:06:12,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:06:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:06:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 13:06:12,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:12,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 79 states. [2018-11-23 13:06:12,175 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 79 states. [2018-11-23 13:06:12,175 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 79 states. [2018-11-23 13:06:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,176 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:06:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:06:12,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:12,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:12,177 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 80 states. [2018-11-23 13:06:12,177 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 80 states. [2018-11-23 13:06:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,178 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:06:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:06:12,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:12,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:12,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:12,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:06:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-23 13:06:12,181 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-11-23 13:06:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:12,181 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-23 13:06:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:06:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-23 13:06:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 13:06:12,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:12,182 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:12,183 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:12,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2018-11-23 13:06:12,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:12,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:12,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:12,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:06:13,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:06:13,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:06:13,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:06:13,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret4 := main(); {13220#true} is VALID [2018-11-23 13:06:13,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:06:13,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {13222#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:06:13,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {13222#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:13,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:13,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:13,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:13,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:13,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:13,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:13,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:13,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:13,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:13,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:13,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:13,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:13,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:13,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:13,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:13,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:13,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:13,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:13,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:13,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:13,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:13,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:13,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:13,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:13,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:13,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:13,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:13,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:13,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:13,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:13,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:13,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:13,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:13,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:13,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:13,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:13,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:13,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:13,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:13,085 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:13,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:13,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:13,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:13,088 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:13,088 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:13,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:13,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:13,090 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:13,091 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:13,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:13,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:13,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:13,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:13,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:13,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:13,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:13,096 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:13,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:13,097 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:13,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:13,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:13,099 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:13,100 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:13,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:13,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 2048); {13221#false} is VALID [2018-11-23 13:06:13,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13221#false} is VALID [2018-11-23 13:06:13,101 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:06:13,102 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:06:13,102 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:06:13,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:06:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:13,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:13,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:34,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 13:06:34,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:34,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:06:34,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:06:34,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:06:34,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:06:34,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret4 := main(); {13220#true} is VALID [2018-11-23 13:06:34,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:34,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {13274#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:34,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {13274#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:34,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:34,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:34,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:34,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:34,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:34,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:34,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:34,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:34,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:34,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:34,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:34,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:34,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:34,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:34,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:34,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:34,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:34,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:34,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:34,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:34,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:34,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:34,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:34,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:34,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:34,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:34,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:34,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:34,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:34,610 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:34,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:34,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:34,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:34,613 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:34,613 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:34,614 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:34,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:34,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:34,616 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:34,617 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:34,617 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:34,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:34,618 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:34,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:34,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:34,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:34,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:34,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:34,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:34,658 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:34,658 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:34,658 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:34,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:34,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:34,659 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:34,660 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:34,660 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:34,661 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:34,661 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:34,662 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:34,662 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:34,663 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:34,664 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:34,664 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:34,665 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 2048); {13221#false} is VALID [2018-11-23 13:06:34,665 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13221#false} is VALID [2018-11-23 13:06:34,666 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:06:34,666 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:06:34,666 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:06:34,666 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:06:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:34,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 13:06:34,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:06:34,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:34,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 13:06:34,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:34,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 13:06:34,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:06:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:06:34,788 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-11-23 13:06:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,140 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:06:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:06:35,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:06:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:06:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:06:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:06:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:06:35,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 88 transitions. [2018-11-23 13:06:35,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:35,231 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:06:35,231 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:06:35,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:06:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:06:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-23 13:06:35,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:35,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 81 states. [2018-11-23 13:06:35,262 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 81 states. [2018-11-23 13:06:35,262 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 81 states. [2018-11-23 13:06:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,264 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:06:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:06:35,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,265 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 82 states. [2018-11-23 13:06:35,265 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 82 states. [2018-11-23 13:06:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,266 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:06:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:06:35,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:35,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:06:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-23 13:06:35,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-11-23 13:06:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:35,268 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-23 13:06:35,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 13:06:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-23 13:06:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:06:35,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:35,269 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:35,269 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:35,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2018-11-23 13:06:35,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:35,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:36,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:06:36,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:06:36,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:06:36,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:06:36,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret4 := main(); {13907#true} is VALID [2018-11-23 13:06:36,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:06:36,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {13909#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:06:36,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {13909#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:36,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:36,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:36,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:36,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:36,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:36,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:36,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:36,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:36,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:36,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:36,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:36,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:36,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:36,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:36,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:36,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:36,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:36,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:36,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:36,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:36,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:36,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:36,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:36,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:36,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:36,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:36,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:36,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:36,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:36,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:36,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:36,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:36,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:36,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:36,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:36,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:36,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:36,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:36,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:36,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:36,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:36,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:36,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:36,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:36,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:36,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:36,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:36,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:36,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:36,155 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:36,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:36,156 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:36,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:36,157 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:36,158 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:36,159 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:36,159 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:36,160 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:36,160 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:36,161 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:36,162 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:36,162 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:36,163 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:36,164 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:36,164 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:36,165 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:36,166 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 2048); {13908#false} is VALID [2018-11-23 13:06:36,166 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13908#false} is VALID [2018-11-23 13:06:36,166 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:06:36,166 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:06:36,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:06:36,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:06:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:36,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:36,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:36,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:36,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:36,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:36,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:36,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:06:36,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:06:36,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:06:36,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:06:36,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret4 := main(); {13907#true} is VALID [2018-11-23 13:06:36,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:36,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:36,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:36,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:36,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:36,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:36,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:36,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:36,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:36,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:36,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:36,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:36,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:36,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:36,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:36,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:36,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:36,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:36,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:36,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:36,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:36,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:36,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:36,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:36,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:36,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:36,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:36,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:36,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:36,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:36,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:36,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:36,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:36,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:36,488 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:36,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:36,489 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:36,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:36,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:36,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:36,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:36,492 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:36,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:36,493 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:36,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:36,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:36,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:36,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:36,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:36,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:36,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:36,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:36,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:36,501 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:36,502 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:36,502 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:36,503 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:36,504 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:36,504 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:36,505 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:36,506 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:36,506 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:36,507 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:36,507 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:36,508 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:36,509 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:36,509 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:36,510 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 2048); {13908#false} is VALID [2018-11-23 13:06:36,510 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13908#false} is VALID [2018-11-23 13:06:36,511 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:06:36,511 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:06:36,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:06:36,511 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:06:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:36,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:36,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 13:06:36,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:06:36,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:36,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:06:36,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:36,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:06:36,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:06:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:06:36,796 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-11-23 13:06:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,421 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:06:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:06:37,422 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:06:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:06:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:06:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:06:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:06:37,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 90 transitions. [2018-11-23 13:06:37,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:37,535 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:06:37,535 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 13:06:37,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:06:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 13:06:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 13:06:37,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:37,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-23 13:06:37,564 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-23 13:06:37,564 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-23 13:06:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,565 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:06:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:06:37,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:37,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:37,566 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-23 13:06:37,566 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-23 13:06:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,567 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:06:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:06:37,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:37,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:37,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:37,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:06:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-23 13:06:37,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-11-23 13:06:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:37,570 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-23 13:06:37,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:06:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-23 13:06:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 13:06:37,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:37,570 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:37,571 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:37,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2018-11-23 13:06:37,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:37,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:37,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:37,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:38,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:06:38,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:06:38,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:06:38,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:06:38,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret4 := main(); {14611#true} is VALID [2018-11-23 13:06:38,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:06:38,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {14613#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:06:38,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {14613#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:38,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:38,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:38,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:38,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:38,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:38,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:38,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:38,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:38,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:38,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:38,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:38,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:38,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:38,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:38,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:38,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:38,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:38,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:38,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:38,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:38,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:38,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:38,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:38,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:38,582 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:38,583 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:38,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:38,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:38,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:38,585 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:38,586 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:38,586 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:38,587 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:38,588 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:38,588 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:38,589 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:38,589 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:38,590 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:38,591 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:38,591 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:38,592 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:38,593 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:38,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:38,594 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:38,594 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:38,595 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:38,596 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:38,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:38,632 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:38,640 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:38,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:38,663 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:38,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:38,676 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:38,692 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:38,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:38,715 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:38,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:38,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:38,749 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:38,761 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:38,774 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:38,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:38,796 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:38,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:38,821 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:38,821 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:38,825 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:38,825 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 2048); {14612#false} is VALID [2018-11-23 13:06:38,825 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14612#false} is VALID [2018-11-23 13:06:38,825 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:06:38,825 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:06:38,826 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:06:38,826 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:06:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:38,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:38,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:39,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 13:06:39,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:40,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:40,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:06:40,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:06:40,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:06:40,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:06:40,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret4 := main(); {14611#true} is VALID [2018-11-23 13:06:40,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:40,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {14667#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:40,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {14667#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:40,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:40,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:40,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:40,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:40,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:40,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:40,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:40,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:40,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:40,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:40,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:40,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:40,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:40,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:40,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:40,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:40,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:40,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:40,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:40,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:40,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:40,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:40,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:40,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:40,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:40,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:40,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:40,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:40,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:40,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:40,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:40,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:40,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:40,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:40,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:40,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:40,270 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:40,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:40,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:40,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:40,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:40,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:40,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:40,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:40,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:40,275 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:40,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:40,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:40,277 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:40,278 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:40,278 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:40,279 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:40,279 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:40,280 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:40,281 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:40,281 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:40,282 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:40,283 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:40,283 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:40,284 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:40,284 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:40,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:40,286 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:40,286 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:40,287 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:40,288 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:40,288 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:40,289 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:40,289 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 2048); {14612#false} is VALID [2018-11-23 13:06:40,290 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14612#false} is VALID [2018-11-23 13:06:40,290 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:06:40,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:06:40,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:06:40,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:06:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:40,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:40,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 13:06:40,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:06:40,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:40,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 13:06:40,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:40,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 13:06:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 13:06:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:06:40,783 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-11-23 13:06:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,326 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:06:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:06:41,326 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:06:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:06:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:06:41,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 92 transitions. [2018-11-23 13:06:41,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:41,436 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:06:41,436 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:06:41,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:06:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:06:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-23 13:06:41,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:41,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:41,501 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:41,502 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,503 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:06:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:06:41,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:41,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:41,504 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2018-11-23 13:06:41,504 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2018-11-23 13:06:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,505 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:06:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:06:41,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:41,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:41,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:41,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:06:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-11-23 13:06:41,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-11-23 13:06:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:41,508 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-11-23 13:06:41,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 13:06:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-11-23 13:06:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 13:06:41,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:41,509 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:41,509 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2018-11-23 13:06:41,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:41,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:42,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:06:42,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:06:42,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:06:42,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:06:42,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret4 := main(); {15332#true} is VALID [2018-11-23 13:06:42,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:06:42,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {15334#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:06:42,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {15334#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:42,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:42,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:42,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:42,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:42,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:42,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:42,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:42,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:42,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:42,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:42,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:42,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:42,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:42,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:42,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:42,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:42,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:42,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:42,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:42,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:42,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:42,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:42,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:42,304 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:42,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:42,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:42,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:42,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:42,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:42,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:42,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:42,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:42,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:42,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:42,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:42,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:42,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:42,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:42,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:42,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:42,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:42,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:42,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:42,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:42,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:42,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:42,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:42,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:42,320 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:42,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:42,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:42,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:42,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:42,323 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:42,323 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:42,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:42,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:42,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:42,326 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:42,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:42,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:42,328 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:42,328 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:42,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:42,330 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:42,330 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:42,331 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:42,332 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:42,332 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:42,333 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:42,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 2048); {15333#false} is VALID [2018-11-23 13:06:42,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15333#false} is VALID [2018-11-23 13:06:42,334 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:06:42,334 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:06:42,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:06:42,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:06:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:42,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:42,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:42,350 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:29,323 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 13:07:29,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:29,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:31,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:07:31,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:07:31,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:07:31,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:07:31,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret4 := main(); {15332#true} is VALID [2018-11-23 13:07:31,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:31,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {15389#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:31,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {15389#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:31,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:31,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:31,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:31,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:31,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:31,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:31,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:31,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:31,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:31,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:31,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:31,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:31,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:31,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:31,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:31,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:31,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:31,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:31,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:31,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:31,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:31,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:31,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:31,493 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:31,493 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:31,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:31,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:31,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:31,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:31,496 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:31,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:31,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:31,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:31,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:31,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:31,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:31,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:31,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:31,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:31,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:31,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:31,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:31,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:31,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:31,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:31,506 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:31,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:31,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:31,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:31,551 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:31,554 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:31,554 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:31,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:31,555 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:31,555 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:31,556 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:31,556 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:31,556 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:31,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:31,557 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:31,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:31,558 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:31,558 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:31,559 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:31,559 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:31,560 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:31,560 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:31,561 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:31,562 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:31,563 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:31,563 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 2048); {15333#false} is VALID [2018-11-23 13:07:31,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15333#false} is VALID [2018-11-23 13:07:31,564 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:07:31,564 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:07:31,564 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:07:31,564 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:07:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:31,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:31,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 13:07:31,597 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:07:31,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:31,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:07:31,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:31,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:07:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:07:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:07:31,685 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-11-23 13:07:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:32,024 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:07:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:07:32,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:07:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:07:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:07:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:07:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:07:32,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 94 transitions. [2018-11-23 13:07:32,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:32,119 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:07:32,119 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 13:07:32,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:07:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 13:07:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 13:07:32,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:32,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 13:07:32,151 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 13:07:32,151 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 13:07:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:32,152 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:07:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:07:32,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:32,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:32,152 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 13:07:32,152 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 13:07:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:32,153 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:07:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:07:32,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:32,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:32,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:32,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:07:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-23 13:07:32,155 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-11-23 13:07:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:32,156 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-23 13:07:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 13:07:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-23 13:07:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:07:32,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:32,157 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:32,157 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:32,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2018-11-23 13:07:32,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:32,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:32,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:32,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:07:32,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:07:32,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:07:32,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:07:32,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret4 := main(); {16070#true} is VALID [2018-11-23 13:07:32,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:07:32,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {16072#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:07:32,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {16072#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:32,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:32,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:32,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:32,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:32,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:32,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:32,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:32,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:32,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:32,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:32,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:32,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:32,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:32,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:32,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:32,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:32,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:32,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:32,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:32,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:32,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:32,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:32,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:32,915 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:32,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:32,916 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:32,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:32,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:32,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:32,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:32,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:32,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:32,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:32,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:32,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:32,922 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:32,923 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:32,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:32,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:32,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:32,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:32,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:32,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:32,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:32,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:32,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:32,929 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:32,930 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:32,930 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:32,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:32,931 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:32,932 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:32,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:32,933 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:32,934 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:32,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:32,935 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:32,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:32,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:32,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:32,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:32,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:32,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:32,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:32,940 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:32,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:32,941 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:32,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:32,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:32,943 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:32,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:32,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:32,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 2048); {16071#false} is VALID [2018-11-23 13:07:32,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16071#false} is VALID [2018-11-23 13:07:32,945 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:07:32,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:07:32,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:07:32,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:07:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:32,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:32,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:32,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:33,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:33,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:07:33,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:07:33,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:07:33,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:07:33,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret4 := main(); {16070#true} is VALID [2018-11-23 13:07:33,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:33,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {16128#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:33,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {16128#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:33,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:33,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:33,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:33,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:33,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:33,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:33,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:33,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:33,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:33,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:33,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:33,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:33,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:33,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:33,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:33,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:33,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:33,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:33,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:33,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:33,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:33,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:33,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:33,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:33,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:33,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:33,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:33,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:33,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:33,321 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:33,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:33,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:33,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:33,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:33,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:33,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:33,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:33,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:33,327 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:33,327 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:33,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:33,329 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:33,329 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:33,330 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:33,330 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:33,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:33,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:33,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:33,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:33,334 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:33,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:33,335 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:33,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:33,336 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:33,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:33,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:33,338 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:33,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:33,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:33,340 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:33,340 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:33,341 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:33,342 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:33,342 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:33,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:33,343 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:33,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:33,345 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:33,345 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:33,346 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:33,346 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:33,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:33,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 2048); {16071#false} is VALID [2018-11-23 13:07:33,348 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16071#false} is VALID [2018-11-23 13:07:33,348 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:07:33,348 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:07:33,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:07:33,349 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:07:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:33,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:33,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 13:07:33,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:07:33,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:33,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 13:07:33,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:33,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 13:07:33,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:07:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:07:33,491 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-11-23 13:07:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:34,031 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 13:07:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:07:34,031 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:07:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:07:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:07:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:07:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:07:34,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 96 transitions. [2018-11-23 13:07:34,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:34,136 INFO L225 Difference]: With dead ends: 96 [2018-11-23 13:07:34,136 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 13:07:34,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:07:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 13:07:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 13:07:34,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:34,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 13:07:34,221 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 13:07:34,221 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 13:07:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:34,223 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:07:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:07:34,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:34,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:34,223 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 13:07:34,224 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 13:07:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:34,225 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:07:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:07:34,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:34,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:34,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:34,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:07:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-23 13:07:34,227 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-11-23 13:07:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:34,227 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-23 13:07:34,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 13:07:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-23 13:07:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 13:07:34,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:34,228 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:34,229 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:34,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2018-11-23 13:07:34,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:34,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:35,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:07:35,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:07:35,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:07:35,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:07:35,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret4 := main(); {16825#true} is VALID [2018-11-23 13:07:35,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:07:35,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {16827#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:07:35,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {16827#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:35,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:35,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:35,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:35,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:35,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:35,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:35,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:35,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:35,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:35,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:35,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:35,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:35,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:35,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:35,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:35,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:35,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:35,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:35,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:35,583 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:35,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:35,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:35,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:35,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:35,586 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:35,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:35,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:35,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:35,589 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:35,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:35,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:35,591 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:35,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:35,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:35,593 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:35,593 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:35,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:35,594 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:35,595 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:35,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:35,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:35,597 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:35,597 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:35,598 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:35,599 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:35,599 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:35,600 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:35,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:35,601 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:35,602 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:35,602 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:35,603 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:35,604 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:35,604 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:35,605 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:35,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:35,606 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:35,607 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:35,607 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:35,608 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:35,609 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:35,609 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:35,610 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:35,610 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:35,611 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:35,612 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:35,612 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:35,613 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:35,613 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:35,614 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:35,615 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:35,615 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:35,616 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:35,617 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:35,617 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 2048); {16826#false} is VALID [2018-11-23 13:07:35,618 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16826#false} is VALID [2018-11-23 13:07:35,618 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:07:35,618 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:07:35,618 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:07:35,618 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:07:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:35,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:35,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:35,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:35,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:36,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:07:36,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:07:36,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:07:36,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:07:36,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret4 := main(); {16825#true} is VALID [2018-11-23 13:07:36,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:36,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {16884#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:36,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {16884#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:36,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:36,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:36,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:36,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:36,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:36,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:36,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:36,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:36,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:36,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:36,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:36,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:36,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:36,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:36,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:36,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:36,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:36,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:36,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:36,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:36,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:36,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:36,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:36,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:36,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:36,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:36,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:36,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:36,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:36,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:36,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:36,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:36,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:36,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:36,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:36,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:36,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:36,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:36,124 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:36,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:36,126 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:36,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:36,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:36,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:36,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:36,129 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:36,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:36,130 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:36,130 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:36,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:36,132 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:36,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:36,133 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:36,134 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:36,134 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:36,135 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:36,135 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:36,136 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:36,137 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:36,137 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:36,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:36,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:36,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:36,140 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:36,140 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:36,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:36,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:36,142 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:36,143 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:36,143 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:36,144 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:36,145 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:36,145 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:36,146 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:36,147 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 2048); {16826#false} is VALID [2018-11-23 13:07:36,147 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16826#false} is VALID [2018-11-23 13:07:36,147 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:07:36,147 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:07:36,147 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:07:36,147 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:07:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 13:07:36,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:07:36,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:36,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:07:36,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:36,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:07:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:07:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:07:36,267 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-11-23 13:07:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,028 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 13:07:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:07:37,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:07:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:07:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:07:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:07:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:07:37,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 98 transitions. [2018-11-23 13:07:37,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:37,128 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:07:37,129 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 13:07:37,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:07:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 13:07:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 13:07:37,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:37,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 13:07:37,164 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 13:07:37,164 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 13:07:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,166 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:07:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:07:37,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,166 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 13:07:37,167 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 13:07:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,168 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:07:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:07:37,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:37,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:07:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-23 13:07:37,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-11-23 13:07:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:37,170 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-23 13:07:37,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:07:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-23 13:07:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 13:07:37,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:37,171 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:37,171 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:37,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2018-11-23 13:07:37,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:37,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:37,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {17597#true} call ULTIMATE.init(); {17597#true} is VALID [2018-11-23 13:07:38,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {17597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17597#true} is VALID [2018-11-23 13:07:38,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {17597#true} assume true; {17597#true} is VALID [2018-11-23 13:07:38,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17597#true} {17597#true} #35#return; {17597#true} is VALID [2018-11-23 13:07:38,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {17597#true} call #t~ret4 := main(); {17597#true} is VALID [2018-11-23 13:07:38,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {17597#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:07:38,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {17599#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:07:38,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {17599#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:38,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {17600#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:38,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {17600#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:38,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {17601#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:38,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {17601#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:38,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {17602#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:38,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {17602#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:38,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {17603#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:38,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {17603#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:38,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {17604#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:38,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {17604#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:38,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {17605#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:38,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {17605#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:38,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {17606#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:38,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {17606#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:38,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {17607#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:38,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {17607#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:38,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {17608#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:38,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {17608#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:38,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {17609#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:38,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {17609#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:38,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {17610#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:38,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {17610#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:38,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {17611#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:38,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {17611#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:38,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {17612#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:38,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {17612#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:38,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {17613#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:38,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {17613#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:38,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {17614#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:38,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {17614#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:38,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {17615#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:38,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {17615#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:38,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {17616#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:38,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {17616#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:38,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {17617#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:38,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {17617#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:38,208 INFO L273 TraceCheckUtils]: 44: Hoare triple {17618#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:38,208 INFO L273 TraceCheckUtils]: 45: Hoare triple {17618#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:38,209 INFO L273 TraceCheckUtils]: 46: Hoare triple {17619#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:38,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {17619#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:38,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {17620#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:38,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {17620#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:38,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {17621#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:38,211 INFO L273 TraceCheckUtils]: 51: Hoare triple {17621#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:38,211 INFO L273 TraceCheckUtils]: 52: Hoare triple {17622#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:38,212 INFO L273 TraceCheckUtils]: 53: Hoare triple {17622#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:38,212 INFO L273 TraceCheckUtils]: 54: Hoare triple {17623#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:38,217 INFO L273 TraceCheckUtils]: 55: Hoare triple {17623#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:38,217 INFO L273 TraceCheckUtils]: 56: Hoare triple {17624#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:38,218 INFO L273 TraceCheckUtils]: 57: Hoare triple {17624#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:38,218 INFO L273 TraceCheckUtils]: 58: Hoare triple {17625#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:38,219 INFO L273 TraceCheckUtils]: 59: Hoare triple {17625#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:38,219 INFO L273 TraceCheckUtils]: 60: Hoare triple {17626#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:38,219 INFO L273 TraceCheckUtils]: 61: Hoare triple {17626#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:38,220 INFO L273 TraceCheckUtils]: 62: Hoare triple {17627#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:38,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {17627#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:38,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {17628#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:38,221 INFO L273 TraceCheckUtils]: 65: Hoare triple {17628#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:38,221 INFO L273 TraceCheckUtils]: 66: Hoare triple {17629#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:38,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {17629#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:38,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {17630#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:38,223 INFO L273 TraceCheckUtils]: 69: Hoare triple {17630#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:38,224 INFO L273 TraceCheckUtils]: 70: Hoare triple {17631#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:38,224 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:38,225 INFO L273 TraceCheckUtils]: 72: Hoare triple {17632#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:38,226 INFO L273 TraceCheckUtils]: 73: Hoare triple {17632#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:38,226 INFO L273 TraceCheckUtils]: 74: Hoare triple {17633#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:38,227 INFO L273 TraceCheckUtils]: 75: Hoare triple {17633#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:38,227 INFO L273 TraceCheckUtils]: 76: Hoare triple {17634#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:38,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {17634#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:38,229 INFO L273 TraceCheckUtils]: 78: Hoare triple {17635#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:38,229 INFO L273 TraceCheckUtils]: 79: Hoare triple {17635#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:38,230 INFO L273 TraceCheckUtils]: 80: Hoare triple {17636#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:38,230 INFO L273 TraceCheckUtils]: 81: Hoare triple {17636#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:38,231 INFO L273 TraceCheckUtils]: 82: Hoare triple {17637#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:38,232 INFO L273 TraceCheckUtils]: 83: Hoare triple {17637#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:38,232 INFO L273 TraceCheckUtils]: 84: Hoare triple {17638#(<= main_~i~0 39)} assume !(~i~0 < 2048); {17598#false} is VALID [2018-11-23 13:07:38,233 INFO L273 TraceCheckUtils]: 85: Hoare triple {17598#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17598#false} is VALID [2018-11-23 13:07:38,233 INFO L256 TraceCheckUtils]: 86: Hoare triple {17598#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1 else 0)); {17598#false} is VALID [2018-11-23 13:07:38,233 INFO L273 TraceCheckUtils]: 87: Hoare triple {17598#false} ~cond := #in~cond; {17598#false} is VALID [2018-11-23 13:07:38,233 INFO L273 TraceCheckUtils]: 88: Hoare triple {17598#false} assume 0 == ~cond; {17598#false} is VALID [2018-11-23 13:07:38,233 INFO L273 TraceCheckUtils]: 89: Hoare triple {17598#false} assume !false; {17598#false} is VALID [2018-11-23 13:07:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:38,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:38,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:38,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2